Results 1 
7 of
7
The P versus NP problem
 Clay Mathematical Institute; The Millennium Prize Problem
, 2000
"... The P versus NP problem is to determine whether every language accepted by some nondeterministic algorithm in polynomial time is also accepted by some (deterministic) algorithm in polynomial time. To define the problem precisely it is necessary to give a formal model of a computer. The standard comp ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
The P versus NP problem is to determine whether every language accepted by some nondeterministic algorithm in polynomial time is also accepted by some (deterministic) algorithm in polynomial time. To define the problem precisely it is necessary to give a formal model of a computer. The standard computer model in computability theory is the Turing machine, introduced by Alan Turing in 1936 [37]. Although the model was introduced before physical computers were built, it nevertheless continues to be accepted as the proper computer model for the purpose of defining the notion of computable function. Informally the class P is the class of decision problems solvable by some algorithm within a number of steps bounded by some fixed polynomial in the length of the input. Turing was not concerned with the efficiency of his machines, rather his concern was whether they can simulate arbitrary algorithms given sufficient time. It turns out, however, Turing machines can generally simulate more efficient computer models (for example, machines equipped with many tapes or an unbounded random access memory) by at most squaring or cubing the computation time. Thus P is a
Logical Approaches to the Complexity of Search Problems: Proof Complexity, Quantified Propositional Calculus, and Bounded Arithmetic
, 2005
"... ..."
Classification of Search Problems and Their Definability in Bounded Arithmetic
, 2001
"... We present a new framework for the study of search problems and their definability in bounded arithmetic. We identify two notions of complexity of search problems: verification complexity and computational complexity. Notions of exact solvability and exact reducibility are developed, and exact b ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We present a new framework for the study of search problems and their definability in bounded arithmetic. We identify two notions of complexity of search problems: verification complexity and computational complexity. Notions of exact solvability and exact reducibility are developed, and exact b i definability of search problems in bounded arithmetic is introduced. We specify a new machine model called the oblivious witnessoracle Turing machines. Based on
Generic Separations and Leaf Languages
 MATHEMATICAL LOGIC QUATERLY
, 2001
"... In the early nineties of the previous century, leaf languages were introduced as a means for the uniform characterization of many complexity classes, mainly in the range between P (polynomial time) and PSPACE (polynomial space). It was shown that the separability of two complexity classes can be ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In the early nineties of the previous century, leaf languages were introduced as a means for the uniform characterization of many complexity classes, mainly in the range between P (polynomial time) and PSPACE (polynomial space). It was shown that the separability of two complexity classes can be reduced to a combinatorial property of the corresponding dening leaf languages. In the present paper, it is shown that every separation obtained in this way holds for every generic oracle in the sense of Blum and Impagliazzo. We obtain several consequences of this result, regarding, e.g., simultaneous separations and universal oracles, resourcebounded genericity, and type2 complexity.
The Relative Complexity of Local Search Heuristics And The Iteration Principle
, 2003
"... Johnson, Papadimitriou and Yannakakis introduce the class PLS consisting of optimization problems for which ecient localsearch heuristics exist. We formulate a type2 problem ITER that characterizes PLS in style of Beame et al., and prove a criterion for type2 problems to be nonreducible to ITER. As ..."
Abstract
 Add to MetaCart
Johnson, Papadimitriou and Yannakakis introduce the class PLS consisting of optimization problems for which ecient localsearch heuristics exist. We formulate a type2 problem ITER that characterizes PLS in style of Beame et al., and prove a criterion for type2 problems to be nonreducible to ITER. As a corollary, we obtain the rst relative separation of PLS from Papadimitriou's classes PPA, PPAD, PPADS, and PPP. Based on the criterion, we derive a special case of Riis's independence criterion for the Bounded Arithmetic 2 (L). We also prove that PLS is closed under Turing reducibility.