1795 search results - page 22 / 359 » On the Complexity of Circuit Satisfiability |
EURODAC
1994
IEEE
13 years 11 months ago
1994
IEEE
An approach for stuck-at-i and delay-fault testing of redundant circuits without modifying the logic is proposed. The only requirement is the ability to control both phases of eac...
CC
2005
Springer
13 years 7 months ago
2005
Springer
We study the complexity of constructing pseudorandom generators (PRGs) from hard functions, focussing on constant-depth circuits. We show that, starting from a function f : {0, 1}l...
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
It is widely suspected that Erdos-R
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...
FOCS
1991
IEEE
13 years 11 months ago
1991
IEEE
Karchmer, Raz, and Wigderson, 1991, discuss the circuit depth complexity of n bit Boolean functions constructed by composing up to d = logn=loglogn levels of k = logn bit boolean