# Turing reduction

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2012

Highly Cited

2012

- ACM Trans. Inf. Syst. Secur.
- 2012

We introduce return-oriented programming, a technique by which an attacker can induce arbitrary behavior in a program whoseâ€¦Â (More)

Is this relevant?

2012

2012

- WOOT
- 2012

Return-oriented programming (ROP) has gained a lot of popularity lately, as an attack against currently implemented defenses inâ€¦Â (More)

Is this relevant?

2008

2008

- Mathematics in Computer Science
- 2008

Introduction Investigation of the infinite behavior of computing devices is of great interest for computer science because manyâ€¦Â (More)

Is this relevant?

2007

2007

- J. Symb. Log.
- 2007

The paper gives a soundness and completeness proof for the implicative fragment of intuitionistic calculus with respect to theâ€¦Â (More)

Is this relevant?

2000

2000

- 2000

We show that any two Medvedev complete Î 1 subsets of 2 Ï‰ are recursively homeomorphic. We obtain a Î 1 set b Q â€² of countableâ€¦Â (More)

Is this relevant?

1998

1998

- Notre Dame Journal of Formal Logic
- 1998

The computable sets form the minimum Ï‰-model of RCA0 and any Ï‰-model of RCA0 is closed under Turing reducibility. RCA0 is strongâ€¦Â (More)

Is this relevant?

1995

1995

- Structure in Complexity Theory Conference
- 1995

This paper investigates the structure of ESPACE under nonuniformTuring reductions that are computed by polynomial size circuits Pâ€¦Â (More)

Is this relevant?

1989

1989

- J. Comput. Syst. Sci.
- 1989

Since the pioneering work of Cook and Karp, an extensive effort has been made in identifying hundreds of apparently intractableâ€¦Â (More)

Is this relevant?

Highly Cited

1982

Highly Cited

1982

- IEEE Transactions on Software Engineering
- 1982

In a distributed computing system made up of different types of processors each processor in the system may have differentâ€¦Â (More)

Is this relevant?

1977

1977

- STOC
- 1977

An open question of [LLS] is whether polynomial time many-one reducibility â‰¤<subscrpt>m</subscrpt><supscrpt><italic>P</italicâ€¦Â (More)

Is this relevant?