1795 search results - page 239 / 359 » On the Complexity of Circuit Satisfiability |
108
Voted
COCO
2010
Springer
15 years 2 months ago
2010
Springer
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
122
Voted
ECOOPW
2008
Springer
15 years 2 months ago
2008
Springer
EOOLT'2007 was the first edition of the ECOOP-EOOLT workshop. The workshop is intended to bring researchers associated with different equation-based object-oriented (EOO) mode...
121
Voted
ECCC
2010
14 years 11 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
DSD
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract—Verification of application requirements is becoming a bottleneck in system-on-chip design, as the number of applications grows. Traditionally, the verification comple...
123
Voted
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...