3172 search results - page 44 / 635 » On the Random-Self-Reducibility of Complete Sets |
103
Voted
TAP
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We consider the problem of test generation for Boolean combinational circuits. We use a novel approach based on the idea of treating tests as a proof encoding rather than...
45
Voted
CORR
2010
Springer
15 years 7 days ago
2010
Springer
A completion of an m-by-n matrix A with entries in {0,1,} is obtained by setting all -entries to
84
Voted
DAGSTUHL
2008
15 years 2 months ago
2008
: Let IIR be the set of closed and bounded intervals of real numbers. Arithmetic in IIR can be defined via the power set IPIR of real numbers. If divisors containing zero are exclu...
111
Voted
MST
2010
14 years 11 months ago
2010
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
98
Voted
ECCC
2002
15 years 14 days ago
2002
We prove that if for some > 0, NP contains a set that is DTIME(2n )-bi-immune, then NP contains a set that is 2-Turing complete for NP (hence 3-truth-table complete) but not 1-t...