scientific article
From MaRDI portal
Publication:3002761
DOI10.4086/toc.2005.v001a008zbMath1213.68302OpenAlexW258748880MaRDI QIDQ3002761
Publication date: 24 May 2011
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2005.v001a008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (7)
Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries ⋮ Expanders and time-restricted branching programs ⋮ Length of polynomials over finite groups ⋮ A nondeterministic space-time tradeoff for linear codes ⋮ Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems ⋮ Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle ⋮ Computing (and Life) Is All about Tradeoffs
This page was built for publication:
