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

Turing reduction

Known as: Turing reducible, Turing reducibility, Turing complete (reduction) 
In computability theory, a Turing reduction from a problem A to a problem B, is a reduction which solves A, assuming the solution to B is already… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
We introduce return-oriented programming, a technique by which an attacker can induce arbitrary behavior in a program whose… Expand
  • figure 1
  • figure 4
  • figure 6
  • figure 8
  • figure 10
Is this relevant?
2012
2012
Return-oriented programming (ROP) has gained a lot of popularity lately, as an attack against currently implemented defenses in… Expand
  • table 1
  • figure 1
  • figure 6
  • figure 7
  • figure 8
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Preface.- Acknowledgments.- Introduction.- I. Background.- Preliminaries.- Computability Theory.- Kolmogorov Complexity of Finite… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
  • R. Soare
  • Bull. Symb. Log.
  • 1996
  • Corpus ID: 5894394
We consider the informal concept of “computability” or “effective calculability” and two of the formalisms commonly used to… Expand
Is this relevant?
Highly Cited
1991
Highly Cited
1991
In this paper, two interesting complexity classes, PP and $ \oplus {\text{P}}$, are compared with PH, the polynomial-time… Expand
Is this relevant?
Highly Cited
1984
Highly Cited
1984
A “promise problem” is a formulation of partial decision problem. Complexity issues about promise problems arise from… Expand
Is this relevant?
Highly Cited
1983
Highly Cited
1983
  • C. Yap
  • Theor. Comput. Sci.
  • 1983
  • Corpus ID: 31802674
We obtain some results of the form: If certain complexity classes satisfy a non-uniform condition, then some unlikely… Expand
Is this relevant?
Highly Cited
1983
Highly Cited
1983
  • K. Ko
  • J. Comput. Syst. Sci.
  • 1983
  • Corpus ID: 11611279
Abstract Self-reducible sets and some low sets, including p -selective sets, and weakly p -selective sets are studied. Several… Expand
Is this relevant?
Highly Cited
1982
Highly Cited
1982
In a distributed computing system made up of different types of processors each processor in the system may have different… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
1963
Highly Cited
1963
There are two different ways of describing uynamicu systems: (i) bymeans of state variables and (ii) by input/output relations… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?