scientific article
From MaRDI portal
Publication:3191584
DOI10.4086/toc.2013.v009a014zbMath1366.68098OpenAlexW3037814438MaRDI QIDQ3191584
Jakob Nordström, Johan T. Håstad
Publication date: 6 October 2014
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2013.v009a014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20)
Related Items (6)
Cumulative Space in Black-White Pebbling and Resolution ⋮ Space Complexity in Polynomial Calculus ⋮ Space characterizations of complexity measures and size-space trade-offs in propositional proof systems ⋮ A Framework for Space Complexity in Algebraic Proof Systems ⋮ Supercritical Space-Width Trade-offs for Resolution ⋮ Total Space in Resolution
Cites Work
This page was built for publication:
