Complexity Barriers as Independence

  title={Complexity Barriers as Independence},
  author={Antonina Kolokolova},
  booktitle={The Incomputable},
After many years of effort, the main questions of complexity theory remain unresolved, even though the concepts involved are simple. Understanding the main idea behind the statement of the “P vs. NP” problem does not require much background (“is it easier to check answers than to produce them?”). Yet, we are as far from resolving it as ever. Much work has been done to unravel the intricate structure in the complexity world, the “complexity zoo”, contains hosts of inhabitants. But the main… 


Relativizing versus Nonrelativizing Techniques: The Role of Local Checkability
It is concluded that relativization techniques cannot prove any meaningful restrictions on the power of the principle of local checkability, which is a known proof technique in complexity theory.
On the Independence of P Versus NP
It is shown that, any question in the field of computational complexity, that can be shown independent of the axioms of Peano Arithmetic is 'practically insignificant', and N P has extremely-close-to-polynomial deterministic time upper bounds.
Algebrization: A New Barrier in Complexity Theory
This article systematically goes through basic results and open problems in complexity theory to delineate the power of the new algebrization barrier, and shows that almost all of the major open problems---including P versus NP, P versus RP, and NEXP versus P/poly---will require non-algebrizing techniques.
An axiomatic approach to algebrization
An axiomatic approach to "algebrization", which complements and clarifies the approaches of [For94] and [AW08], and presents logical theories formalizing the notion of algebrizing techniques in the following sense.
Is P Versus NP Formally Independent?
This is a survey about the title question, written for people who (like the author) see logic as forbidding, esoteric, and remote from their usual concerns. Beginning with a crash course on
Feasibly constructive proofs and the propositional calculus (Preliminary Version)
  • S. Cook
  • Mathematics, Computer Science
  • 1975
The Main Theorem (5.5) in this paper describes the power of extended resolution in a way that may provide a handle for showing that no proof system for the tautologies is “super” in the sense that there is a short proof for every tautology.
Expressing versus Proving: Relating Forms of Complexity in Logic
It is shown how the complexity of logics in the setting of finite model theory is used to obtain results in bounded arithmetic, stating which functions are provably total in certain weak systems of arithmetic.
Truth and Turing : Systems of Logic based on Ordinals
  • Computer Science
  • 2011
Turing’s construction in Systems of Logic based on Ordinals on progressions of theories, with some recent similar looking progression of axiomatisations of truth sets is links with the original paper on Incompleteness Phenomenon and the notion of an ‘ordinal progression’.
Bounded Arithmetic and Lower Bounds in Boolean Complexity
This work studies the question of provability of lower bounds on the complexity of explicitly given Boolean functions in weak fragments of Peano Arithmetic and gives a more constructive version of the proof of Hastad Switching Lemma.
The Role of Relativization in Complexity Theory
This paper takes a look at how complexity theorists use and misuse oracle results and pays special attention to the new interactive proof systems and program checking results and tries to understand why they do not relativize.