Fundamentals of Computation Theory

DOI10.1007/11537311zbMath1122.68453OpenAlexW2491671784MaRDI QIDQ5492911

Nicole Schweikardt, Martin Grohe, Christoph Koch

Publication date: 20 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11537311

Mathematics Subject Classification ID

Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (2)

Tight lower bounds for query processing on streaming and external memory data ⋮ Reversal complexity revisited

This page was built for publication: Fundamentals of Computation Theory