Skip to main content
Research
Focus areas
Blog
Publications
Careers
About
Back
Focus areas
Semiconductors
Artificial Intelligence
Quantum Computing
Hybrid Cloud
Back
About
Overview
Labs
People
Back
Semiconductors
Back
Artificial Intelligence
Back
Quantum Computing
Back
Hybrid Cloud
Back
Overview
Back
Labs
Back
People
Research
Focus areas
Semiconductors
Artificial Intelligence
Quantum Computing
Hybrid Cloud
Blog
Publications
Careers
About
Overview
Labs
People
Open IBM search field
Close
STOC 1984
Conference paper
30 Apr 1984
FAST ALGORITHMS FOR N-DIMENSIONAL RESTRICTIONS OF HARD PROBLEMS.
View publication
Abstract
No abstract available.
Related
Conference paper
Automata theoretic techniques for modal logics of programs (extended abstract)
Conference paper
The complexity of elementary algebra and geometry (preliminary version)
Conference paper
Finding euler circuits in logarithmic parallel time
Conference paper
On monotone formulae with restricted depth (preliminary version)
View all publications
