Number of the records: 1
On the complexity of circuit satisfiability
SYS 0351120 LBL 01174^^^^^2200253^^^450 005 20240103194302.9 014 $a 77954691768 $2 SCOPUS 017 70
$a 10.1145/1806689.1806724 $2 DOI 100 $a 20101208d m y slo 03 ba 101 0-
$a eng $d eng 102 $a US 200 1-
$a On the complexity of circuit satisfiability 215 $a 9 s. 463 -1
$1 001 cav_un_epca*0351119 $1 010 $a 978-1-60558-817-9 $1 200 1 $a STOC'10 : Proceedings of the 2010 ACM International Symposium on Theory of Computing $v S. 241-249 $1 210 $a New York $c Association for Computing Machinery $d 2010 610 0-
$a Circuit satisfiability 610 0-
$a NP-completeness 700 -1
$3 cav_un_auth*0266574 $a Paturi $b R. $y US $4 070 701 -1
$3 cav_un_auth*0100699 $a Pudlák $b Pavel $i Matematická logika a teoretická informatika $j Mathematical Logic and Theoretical Computer Science $l MLTCS $p MU-W $w Mathematical Logic and Theoretical Computer Science $4 070 $T Matematický ústav AV ČR, v. v. i. 856 $u http://dl.acm.org/citation.cfm?doid=1806689.1806724
Number of the records: 1