COMPLEXITY OF BACKTRACK SEARCHES.
- Larry Carter
- Larry Stockmeyer
- et al.
- 1985
- STOC 1985
Publications
Date
Featured collections
Popular topics
52 results for Larry Stockmeyer
Bounded-depth, polynomial-size circuits for symmetric functions
- Ronald Fagin
- Maria M. Klawe
- et al.
- 1985
- Theoretical Computer Science
Pseudorandom number generation and space complexity
- Merrick Furst
- Richard Lipton
- et al.
- 1985
- Information and Control
Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
- Yuri Gurevich
- Larry Stockmeyer
- et al.
- 1984
- Journal of the ACM
Alternation bounded auxiliary pushdown automata
- Richard E. Ladner
- Larry J. Stockmeyer
- et al.
- 1984
- Information and Control
CONSTANT DEPTH REDUCIBILITY.
- A.K. Chandra
- Larry Stockmeyer
- et al.
- 1984
- SIAM Journal on Computing
Optimal orientations of cells in slicing floorplan designs
- Larry Stockmeyer
- 1983
- Information and Control
NP-completeness of some generalizations of the maximum matching problem
- Larry J. Stockmeyer
- Vijay V. Vazirani
- 1982
- Information Processing Letters
A Dictionary Machine (for VLSI)
- Thomas A. Ottmann
- Arnold L. Rosenberg
- et al.
- 1982
- IEEE TC
Alternation
- Ashok K. Chandra
- Dexter C. Kozen
- et al.
- 1981
- Journal of the ACM