Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2014
Review
2014
Summary Traditional police–suspect interviews differ from intelligence interviews in several important ways, and these… Expand
Review
2013
Review
2013
Riparian buffer zones (RBZ) improve water quality in different ways depending upon the pathway of delivery of water to the RBZ… Expand
  • figure 2
  • figure 3
Review
2012
Review
2012
Abstract In the present paper, we give a survey of the recent results and outline future prospects of the tensor-structured… Expand
  • table 3.1
  • table 3.3
  • table 4.1
  • figure 4.1
  • table 4.2
Highly Cited
2011
Highly Cited
2011
Five decades of lie detection research have shown that people’s ability to detect deception by observing behavior and listening… Expand
Review
2005
Review
2005
1. Overview One limitation of the truth table approach is that it is designed for causal conditions are simple presence/absence… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Highly Cited
2004
Highly Cited
2004
With in situ and laboratory chamber incubations we demonstrate that coral mucus, an important component of particulate organic… Expand
  • table 1
  • figure 1
  • table 2
  • table 3
  • figure 2
2004
2004
Abstract Deviating from standard possible-worlds semantics, authors belonging to what might be called the ‘imperative tradition… Expand
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… Expand
1987
1987
It is shown that there exist r.e. degrees other than 0 and 0' which have a greatest r.e. 1-degree. This solves an old question of… Expand
Highly Cited
1978
Highly Cited
1978
Conventional programming languages are growing ever more enormous, but not stronger. Inherent defects at the most basic level… Expand