On the complexity of circuit satisfiability
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F10%3A00351120" target="_blank" >RIV/67985840:_____/10:00351120 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On the complexity of circuit satisfiability
Original language description
We derive tight bounds on the exponent of the success probability for deciding the circuit satisfiability problem in a variety of probabilistic computational models under complexity asumptions.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
STOC'10 : proceedings of the 2010 ACM International Symposium on theory ov computing
ISBN
978-1-60558-817-9
ISSN
—
e-ISSN
—
Number of pages
9
Pages from-to
—
Publisher name
Association for Computing Machinery
Place of publication
New York
Event location
Cambridge
Event date
Jun 5, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—