Skip to search formSkip to main content
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.
2017
2017
We examined the effect of encoding quality and retention interval on the verbal accounts of truth tellers and liars. Truthful and… Expand
  • table 1
  • table 3
  • table 4
  • table 5
Is this relevant?
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
Is this relevant?
Highly Cited
2008
Highly Cited
2008
A critical view of the alleged significance of Belnap four-valued logic for reasoning under inconsistent and incomplete… Expand
  • table 1
  • table 2
  • table 3
  • table 6
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We propose exponentially weighted quantile regression (EWQR) for estimating time-varying quantiles. The EWQR cost function can be… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
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… Expand
  • table 1
  • figure 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
2004
2004
Abstract Deviating from standard possible-worlds semantics, authors belonging to what might be called the ‘imperative tradition… Expand
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… Expand
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… Expand
Is this relevant?
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
Is this relevant?
Highly Cited
1974
Highly Cited
1974
Comparison of the polynomial-time-bounded reducibilities introduced by Cook [1] and Karp [4] leads naturally to the definition of… Expand
Is this relevant?