The complexity of combinatorial problems with succinct input representation

This publication has 20 references indexed in Scilit:

• BPP and the polynomial hierarchy
  Information Processing Letters, 1983
• Generalized Kolmogorov complexity and the structure of feasible computations
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1983
• Succinct representations of graphs
  Information and Control, 1983
• The complexity of compacting hierarchically specified layouts of integrated circuits
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1982
• On the complexity of unique solutions
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1982
• The complexity of facets (and some facets of complexity)
  Published by Association for Computing Machinery (ACM) ,1982
• On counting problems and the polynomial-time hierarchy
  Theoretical Computer Science, 1980
• Computational Complexity of Probabilistic Turing Machines
  SIAM Journal on Computing, 1977
• Log Space Recognition and Translation of Parenthesis Languages
  Journal of the ACM, 1977
• The circuit value problem is log space complete for P
  ACM SIGACT News, 1975