AbstractWe show that polynomial time truth-table reducibility via Boolean circuits to SAT is the same as logspace truth-table reducibility via Boolean formulas to SAT and the same as logspace Turing reducibility to SAT. In addition, we prove that a constant number of rounds of parallel queries to SAT is equivalent to one round of parallel queries. We give an oracle relative to which Δ2p is not equal to the class of predicates polynomial time truth-table reducible to SAT
We present a constructive analysis and machine-checked synthetic approach to the theory of one-one, ...
<正> Let A, B are sets. We can define the reducibility ≤_T~h by A≤_T~hB iff there-exists a poly...
AbstractIn this paper we study the effect that the self-reducibility properties of a set have on its...
We show that polynomial time truth-table reducibility via Boolean circuits to SAT is the same as lo...
AbstractWe show that polynomial time truth-table reducibility via Boolean circuits to SAT is the sam...
AbstractVarious polynomial-time truth-table reducibilities are compared by their ability of using sp...
For various polynomial-time reducibilities r , this paper asks whether being r-reducible to a spars...
The polynomialtime many-one and Turing reducibilities, Karp and Cook reducibilities respectively, p...
Ogiwara and Watanabe showed that if SAT is bounded truth-table reducible to a sparse set, then P = N...
AbstractWe study the complexity of decision problems that can be solved by a polynomial-time Turing ...
We make an elaborate analysis of the intervals defined by the ordered list of queries to the p-selec...
A notion of log space Turing reducibility is introduced. It is used to define relative notions of lo...
We may believe SAT does not have small Boolean circuits. But is it possible that some language with ...
AbstractVarious forms of polynomial time reducibility are compared. Among the forms examined are man...
Strong reducibilities such as the m-reducibility have been around implicitly, if not explicitly, sin...
We present a constructive analysis and machine-checked synthetic approach to the theory of one-one, ...
<正> Let A, B are sets. We can define the reducibility ≤_T~h by A≤_T~hB iff there-exists a poly...
AbstractIn this paper we study the effect that the self-reducibility properties of a set have on its...
We show that polynomial time truth-table reducibility via Boolean circuits to SAT is the same as lo...
AbstractWe show that polynomial time truth-table reducibility via Boolean circuits to SAT is the sam...
AbstractVarious polynomial-time truth-table reducibilities are compared by their ability of using sp...
For various polynomial-time reducibilities r , this paper asks whether being r-reducible to a spars...
The polynomialtime many-one and Turing reducibilities, Karp and Cook reducibilities respectively, p...
Ogiwara and Watanabe showed that if SAT is bounded truth-table reducible to a sparse set, then P = N...
AbstractWe study the complexity of decision problems that can be solved by a polynomial-time Turing ...
We make an elaborate analysis of the intervals defined by the ordered list of queries to the p-selec...
A notion of log space Turing reducibility is introduced. It is used to define relative notions of lo...
We may believe SAT does not have small Boolean circuits. But is it possible that some language with ...
AbstractVarious forms of polynomial time reducibility are compared. Among the forms examined are man...
Strong reducibilities such as the m-reducibility have been around implicitly, if not explicitly, sin...
We present a constructive analysis and machine-checked synthetic approach to the theory of one-one, ...
<正> Let A, B are sets. We can define the reducibility ≤_T~h by A≤_T~hB iff there-exists a poly...
AbstractIn this paper we study the effect that the self-reducibility properties of a set have on its...
DOI
Add to ORKG