Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

Highly Cited

2014

Highly Cited

2014

Modern computability theory began with Turing [Turing, 1936], where he introduced the notion of a function computable by a Turing… Expand

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

Highly Cited

2010

Highly Cited

2010

Preface.- Acknowledgments.- Introduction.- I. Background.- Preliminaries.- Computability Theory.- Kolmogorov Complexity of Finite… Expand

Highly Cited

1996

Highly Cited

1996

We consider the informal concept of “computability” or “effective calculability” and two of the formalisms commonly used to… Expand

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

Highly Cited

1984

Highly Cited

1984

A “promise problem” is a formulation of partial decision problem. Complexity issues about promise problems arise from… Expand

Highly Cited

1983

Highly Cited

1983

We obtain some results of the form: If certain complexity classes satisfy a non-uniform condition, then some unlikely… Expand

Highly Cited

1983

Highly Cited

1983

Abstract Self-reducible sets and some low sets, including p -selective sets, and weakly p -selective sets are studied. Several… Expand

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

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