Structural Complexity I

This is the first volume of a systematic two-volume presentation of the various areas of research on structural complexity. The theory of algorithmic complexity, a part of the mathematical theory of computation, can be approached from several points of view, one of which is the structural one. This volume is written for undergraduate students who have taken a first course in Formal Language Theory. It presents the basic concepts of structural complexity, thus providing the background necessary for the understanding of complexity theory. The second corrected edition has been extended by an appendix with recent results on nondeterministic space classes and updated with regard to the bibliographical remarks and the references.

[1]  Neil Immerman.  Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..

[2]  A. Church.  An Unsolvable Problem of Elementary Number Theory , 1936 .

[3]  Richard J. Lipton,et al.  Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

[4]  José L. Balcázar,et al.  The polynomial-time hierarchy and sparse oracles , 1986, JACM.

[5]  Uwe Schöning.  On Small Generators , 1984, Theor. Comput. Sci..

[6]  L. Hemachandra.  The strong exponential hierarchy collapses , 1987, STOC 1987.

[7]  Alan L. Selman,et al.  Analogues of Semicursive Sets and Effective Reducibilities to the Study of NP Complexity , 1982, Inf. Control..

[8]  Alan L. Selman,et al.  Polynomial Time Enumeration Reducibility , 1978, SIAM J. Comput..

[9]  Elaine J. Weyuker,et al.  Computability, complexity, and languages - fundamentals of theoretical computer science , 2014, Computer science and applied mathematics.

[10]  Chee-Keng Yap,et al.  Some Consequences of Non-Uniform Conditions on Uniform Classes , 1983, Theor. Comput. Sci..

[11]  Claude E. Shannon,et al.  The Number of Two‐Terminal Series‐Parallel Networks , 1942 .

[12]  Michael I. Dekhtyar,et al.  On the Relativization of Deterministic and Nondeterministic Complexity Classes , 1976, MFCS.

[13]  Ravi Kannan,et al.  Circuit-Size Lower Bounds and Non-Reducibility to Sparse Sets , 1982, Inf. Control..

[14]  Alan L. Selman,et al.  Reductions on NP and P-Selective Sets , 1982, Theor. Comput. Sci..

[15]  Michael J. Fischer,et al.  Relations Among Complexity Measures , 1979, JACM.

[16]  José L. Balcázar,et al.  Some comments about notations of orders of manitude , 1986, Bull. EATCS.

[17]  Janos Simon,et al.  Space-Bounded Hierarchies and Probabilistic Computations , 1984, J. Comput. Syst. Sci..

[18]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[19]  A. Church.  A Set of Postulates for the Foundation of Logic , 1932 .

[20]  Stathis Zachos,et al.  Robustness of Probabilistic Computational Complexity Classes under Definitional Perturbations , 1982, Inf. Control..

[21]  Stephen R. Mahaney.  Sparse Complete Sets of NP: Solution of a Conjecture of Berman and Hartmanis , 1982, J. Comput. Syst. Sci..

[22]  Neil D. Jones,et al.  Space-Bounded Reducibility among Combinatorial Problems , 1975, J. Comput. Syst. Sci..

[23]  José L. Balcázar,et al.  On Characterizations of the Class PSPACE/POLY , 1987, Theor. Comput. Sci..

[24]  Neil D. Jones,et al.  Complete problems for deterministic polynomial time , 1974, STOC '74.

[25]  Joaquim Gabarró.  Initial Index: A New Complexity Function for Languages , 1983, ICALP.

[26]  Clemens Lautemann,et al.  BPP and the Polynomial Hierarchy , 1983, Inf. Process. Lett..

[27]  C. J. Mitchell.  PRIMALITY AND CRYPTOGRAPHY (Wiley‐Teubner Series in Computer Science) , 1987 .

[28]  José L. Balcázar,et al.  A Note on a Theorem by Ladner , 1982, Inf. Process. Lett..

[29]  Mihalis Yannakakis,et al.  The complexity of facets (and some facets of complexity) , 1982, STOC '82.

[30]  David A. Plaisted,et al.  New NP-hard and NP-complete polynomial and integer divisibility problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[31]  John T. Gill,et al.  Computational complexity of probabilistic Turing machines , 1974, STOC '74.

[32]  Charles Rackoff,et al.  Relativized questions involving probabilistic algorithms , 1978, STOC 1978.

[33]  Donald E. Knuth,et al.  Big Omicron and big Omega and big Theta , 1976, SIGA.

[34]  Kurt Gödel,et al.  On Formally Undecidable Propositions of Principia Mathematica and Related Systems , 1966 .

[35]  Ker-I Ko,et al.  Continuous optimization problems and a polynomial hierarchy of real functions , 1985, J. Complex..

[36]  Uwe Schöning,et al.  Complexity and Structure , 1986, Lecture Notes in Computer Science.

[37]  Hisao Yamada,et al.  Real-Time Computation and Recursive Functions Not Real-Time Computable , 1962, IRE Trans. Electron. Comput..

[38]  Ker-I Ko,et al.  Some Observations on the Probabilistic Algorithms and NP-hard Problems , 1982, Inf. Process. Lett..

[39]  Celia Wrathall,et al.  Complete Sets and the Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[40]  Harry B. Hunt,et al.  The LBA Problem and its Importance in the Theory of Computing , 1973 .

[41]  Norbert Blum.  A Boolean Function Requiring 3n Network Size , 1984, Theor. Comput. Sci..

[42]  C. Papadimitriou,et al.  Two remarks on the power of counting , 1983 .

[43]  Stathis Zachos,et al.  Probabilistic machines, oracles, and quantifiers , 1985 .

[44]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[45]  Claus-Peter Schnorr,et al.  Optimal Algorithms for Self-Reducible Problems , 1976, ICALP.

[46]  Richard Edwin Stearns,et al.  Two-Tape Simulation of Multitape Turing Machines , 1966, JACM.

[47]  Ker-I Ko.  On Self-Reducibility and Weak P-Selectivity , 1983, J. Comput. Syst. Sci..

[48]  John H. Reif,et al.  Probabilistic algorithms in group theory , 1985, FCT.

[49]  Michael Sipser,et al.  A complexity theoretic approach to randomness , 1983, STOC.

[50]  Uwe Schöning.  A Uniform Approach to Obtain Diagonal Sets in Complexity Classes , 1982, Theor. Comput. Sci..

[51]  Klaus W. Wagner,et al.  Collapsing Oracle Hierarchies, Census Functions and Logarithmically Many Queries , 1988, STACS.

[52]  Stathis Zachos,et al.  A Decisive Characterization of BPP , 1986, Inf. Control..

[53]  Kojiro Kobayashi.  On Proving Time Constructibility of Functions , 1985, Theor. Comput. Sci..

[54]  Juris Hartmanis.  On Sparse Sets in NP - P , 1983, Inf. Process. Lett..

[55]  L. H. Harper,et al.  On the complexity of the marriage problem , 1972 .

[56]  Richard Edwin Stearns,et al.  Memory bounds for recognition of context-free and context-sensitive languages , 1965, SWCT.

[57]  PAUL CHEW,et al.  A Note on Structure and Looking Back Applied to the Complexity of Computable Functions , 1981, J. Comput. Syst. Sci..

[58]  Claude E. Shannon,et al.  The synthesis of two-terminal switching circuits , 1949, Bell Syst. Tech. J..

[59]  Stephen A. Cook,et al.  An observation on time-storage trade off , 1973, J. Comput. Syst. Sci..

[60]  Richard J. Lipton,et al.  On the Structure of Sets in NP and Other Complexity Classes , 1981, Theor. Comput. Sci..

[61]  Michael Sipser,et al.  Halting space-bounded computations , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[62]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[63]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[64]  John E. Savage,et al.  Computational Work and Time on Finite Machines , 1972, JACM.

[65]  José L. Balcázar,et al.  Nonuniform Complexity Classes Specified by Lower and Upper Bounds , 1989, RAIRO Theor. Informatics Appl..

[66]  Aaron D. Wyner,et al.  Computability by Probabilistic Machines , 1993 .

[67]  Lance Fortnow,et al.  PP is Closed Under Truth-Table Reductions , 1996, Inf. Comput..

[68]  Uwe Schöning.  Minimal pairs for P , 1984, Theor. Comput. Sci..

[69]  Yehoshua Bar-Hillel,et al.  The Intrinsic Computational Difficulty of Functions , 1969 .

[70]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[71]  Ker-I Ko,et al.  On Helping by Robust Oracle Machines , 1987, Theor. Comput. Sci..

[72]  S. Kleene.  General recursive functions of natural numbers , 1936 .

[73]  Janos Simon.  On some central problems in computational complexity , 1975 .

[74]  Volker Strassen,et al.  A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..

[75]  C. Jockusch.  Semirecursive sets and positive reducibility , 1968 .

[76]  John Gill,et al.  Relativizations of the P =? NP Question , 1975, SIAM J. Comput..

[77]  W. Pitts,et al.  A Logical Calculus of the Ideas Immanent in Nervous Activity (1943) , 2021, Ideas That Created the Future.

[78]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[79]  Daniel A. Spielman,et al.  PP is closed under intersection , 1991, STOC '91.

[80]  Pekka Orponen,et al.  Complexity Classes of Alternating Machines with Oracles , 1983, ICALP.

[81]  Albert R. Meyer,et al.  The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[82]  Timothy J. Long.  Strong Nondeterministic Polynomial-Time Reducibilities , 1982, Theor. Comput. Sci..

[83]  David A. Russo.  Structural properties of complexity classes , 1985, Research in computer science.

[84]  Gary L. Miller.  Riemann's Hypothesis and Tests for Primality , 1976, J. Comput. Syst. Sci..

[85]  Robert W. Ritchie,et al.  CLASSES OF PREDICTABLY COMPUTABLE FUNCTIONS , 1963 .

[86]  Robert McNaughton,et al.  Introduction to Formal Languages (G. E. Revesz) , 1989, SIAM Review.

[87]  Lane A. Hemaspaandra,et al.  Using Inductive Counting to Simulate Nondeterministic Computation , 1990, MFCS.

[88]  Uwe Schöning,et al.  Robust Algorithms: A Different Approach to Oracles , 1984, Theor. Comput. Sci..

[89]  Diana Schmidt.  The Recursion-Theoretic Structure of Complexity Classes , 1985, Theor. Comput. Sci..

[90]  Peter van Emde Boas,et al.  On tape versus core an application of space efficient perfect hash functions to the invariance of space , 1984, STOC '84.

[91]  Uwe Schöning.  A note on complete sets for the polynomial-time hierarchy , 1981, SIGA.

[92]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[93]  Eugene S. Santos,et al.  Probabilistic Turing machines and computability , 1969 .

[94]  Volker Strassen,et al.  Erratum: A Fast Monte-Carlo Test for Primality , 1978, SIAM J. Comput..

[95]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[96]  R. Ladner.  The circuit value problem is log space complete for P , 1975, SIGA.

[97]  Hans Heller.  On Relativized Polynomial and Exponential Computations , 1984, SIAM J. Comput..

[98]  Vaughan R. Pratt,et al.  Every Prime has a Succinct Certificate , 1975, SIAM J. Comput..

[99]  Allan Borodin,et al.  Two applications of complementation via inductive counting , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[100]  Eugene S. Santos,et al.  Computability by probabilistic Turing machines , 1971 .

[101]  J. Hartmanis,et al.  Computation Times of NP Sets of Different Densities , 1984, Theor. Comput. Sci..

[102]  Kenneth W. Regan.  On Diagonalization Methods and the Structure of Language Classes , 1983, FCT.

[103]  Claude E. Shannon,et al.  A symbolic analysis of relay and switching circuits , 1938, Transactions of the American Institute of Electrical Engineers.

[104]  Nicholas Pippenger,et al.  On simultaneous resource bounds , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[105]  Alfred V. Aho,et al.  The design and analysis of algorithms , 1974 .

[106]  Richard E. Ladner,et al.  On the Structure of Polynomial Time Reducibility , 1975, JACM.

[107]  Klaus W. Wagner,et al.  The Difference and Truth-Table Hierarchies for NP , 1987, RAIRO Theor. Informatics Appl..

[108]  Allan Borodin,et al.  On Relating Time and Space to Size and Depth , 1977, SIAM J. Comput..

[109]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[110]  Ronald V. Book,et al.  On Languages Accepted in Polynomial Time , 1972, SIAM J. Comput..

[111]  Joaquim Gabarró Vallès,et al.  Uniform characterizations of non-uniform complexity measures , 1985 .