On the structure of intractable sets

[1]  Manuel Blum,et al.  On Almost Everywhere Complex Recursive Functions , 1974, JACM.

[2]  Alan L. Selman,et al.  Complexity Measures for Public-Key Cryptosystems , 1988, SIAM J. Comput..

[3]  Juris Hartmanis,et al.  On Isomorphisms and Density of NP and Other Complete Sets , 1977, SIAM J. Comput..

[4]  Wolfgang Maass,et al.  Oracle-Dependent Properties of the Lattice of NP Sets , 1983, Theor. Comput. Sci..

[5]  Joachim Grollmann,et al.  Relativizations of Unambiguous and Random Polynomial Time Classes , 1986, SIAM J. Comput..

[6]  Sartaj Sahni,et al.  Computationally Related Problems , 1974, SIAM J. Comput..

[7]  A. Turing,et al.  On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction , 1938 .

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

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

[10]  Yacov Yacobi,et al.  Hard-core theorems for complexity classes , 1985, JACM.

[11]  Pekka Orponen,et al.  The Structure of Polynomial Complexity Cores (Extended Abstract) , 1984, MFCS.

[12]  Klaus Ambos-Spies.  On the Relative Complexity of Subproblems of Intractable Problems , 1985, STACS.

[13]  Michael J. Fischer,et al.  Separating Nondeterministic Time Complexity Classes , 1978, JACM.

[14]  Paul Young,et al.  An introduction to the general theory of algorithms , 1978 .

[15]  Michael Sipser,et al.  On Relativization and the Existence of Complete Sets , 1982, ICALP.

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

[17]  Endre Szemerédi,et al.  On determinism versus non-determinism and related problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

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

[19]  Seth Breidbart.  On Splitting Recursive Sets , 1978, J. Comput. Syst. Sci..

[20]  Eric Allender,et al.  The Complexity of Sparse Sets in P , 1986, SCT.

[21]  Eric Allender,et al.  P-Printable Sets , 1988, SIAM J. Comput..

[22]  Christopher S. Hill,et al.  Mechanism, Mentalism and Metamathematics , 1980 .

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

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

[25]  Juris Hartmanis,et al.  Generalized Kolmogorov complexity and the structure of feasible computations , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[26]  Philippe Flajolet,et al.  On Sets Having Only Hard Subsets , 1974, ICALP.

[27]  A. R. Meyer,et al.  COMPUTATIONALLY COMPLEX AND PSEUDO-RANDOM ZERO-ONE VALUED FUNCTIONS††Portions of this work were carried out at Carngie-Mellon University, while the authors were in the Department of Computer Science. Portions of these results were reported in preliminary form in [1]. , 1971 .

[28]  Leonard M. Adleman,et al.  Reducibility, randomness, and intractibility (Abstract) , 1977, STOC '77.

[29]  Stephen A. Cook,et al.  A hierarchy for nondeterministic time complexity , 1972, J. Comput. Syst. Sci..

[30]  Nancy A. Lynch,et al.  On Reducibility to Complex or Sparse Sets , 1975, JACM.

[31]  Richard Edwin Stearns,et al.  Hierarchies of memory limited computations , 1965, SWCT.

[32]  Emil L. Post.  Recursively enumerable sets of positive integers and their decision problems , 1944 .

[33]  Osamu Watanabe,et al.  What Is a Hard Instance of a Computational Problem? , 1986, SCT.

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

[35]  M. Rabin.  Degree of difficulty of computing a function and a partial ordering of recursive sets , 1960 .

[36]  R.E. Ladner,et al.  A Comparison of Polynomial Time Reducibilities , 1975, Theor. Comput. Sci..

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

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

[39]  Leslie G. Valiant,et al.  Relative Complexity of Checking and Evaluating , 1976, Inf. Process. Lett..

[40]  John von Neumann,et al.  1. A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem , 1953 .

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

[42]  Wolfgang J. Paul,et al.  On time hierarchies , 1977, STOC '77.

[43]  Yacov Yacobi,et al.  The Complexity of Promise Problems with Applications to Public-Key Cryptography , 1984, Inf. Control..

[44]  Arnold L. Rosenberg,et al.  Real-Time Simulation of Multihead Tape Units , 1972, JACM.

[45]  J. Ferrante,et al.  The computational complexity of logical theories , 1979 .

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

[47]  Martin Fürer,et al.  The tight deterministic time hierarchy , 1982, STOC '82.

[48]  José L. Balcázar,et al.  Immunity and Simplicity in Relativizations of Probabilistic Complexity Classes , 1988, RAIRO Theor. Informatics Appl..

[49]  Uwe Schöning,et al.  Immunity, Relativizations, and Nondeterminism , 1984, SIAM J. Comput..

[50]  Leonard Berman,et al.  On the structure of complete sets: Almost everywhere complexity and infinitely often speedup , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

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

[52]  Paul Young,et al.  Some structural properties of polynomial reducibilities and sets in NP , 1983, STOC.

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

[54]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[55]  Arnold L. Rosenberg,et al.  Real-Time Definable Languages , 1967, JACM.

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

[57]  Timothy J. Long,et al.  Quantitative Relativizations of Complexity Classes , 1984, SIAM J. Comput..

[58]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

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

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