Truth-table reduction

Known as: Tt-reduction, Bounded Turing reduction, Weak truth table reduction 
In computability theory, a truth-table reduction is a reduction from one set of natural numbers to another. As a "tool", it is weaker than Turing… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
For a computable field F , the splitting set SF of F is the set of polynomials with coefficients in F which factor over F , and… (More)
Is this relevant?
2009
2009
A static dependency pair method, proposed by us, can effectively prove termination of simply-typed term rewriting systems (STRSs… (More)
Is this relevant?
2005
2005
Reduction of U(VI) under iron reducing conditions was studied in a model system containing the dissimilatory metalreducing… (More)
  • table 1
  • figure 1
  • table 3
  • figure 2
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
With in situ and laboratory chamber incubations we demonstrate that coral mucus, an important component of particulate organic… (More)
  • table 1
  • figure 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
2004
2004
Deviating from standard possible-worlds semantics, authors belonging to what might be called the ‘imperative tradition’ of… (More)
Is this relevant?
2001
2001
The following theorems on the structure inside nonrecursive truth-table degrees are established: D egtev's result that the number… (More)
Is this relevant?
1998
1998
We prove that there is no sparse hard set for P under logspace computable bounded truth-table reductions unless P=L. In case of… (More)
Is this relevant?
1996
1996
Let P P-comp denote the sets that are solvable in polynomial time on average under every polynomial-time computable distribution… (More)
Is this relevant?
1993
1993
When a definite noun phrase fails to refer, the statement containing it is often felt to lack a truth value, as in The king of… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We show that polynomial time truth-table reducibility via Boolean circuits to SAT is the same as logspace truth-table… (More)
Is this relevant?