Automata, Languages and Programming

DOI10.1007/11523468zbMath1085.68032OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716844

Corina E. Ptraşcu, Mihai Pǎtraşcu

Publication date: 10 January 2006

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

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Related Items (2)

Integer representation and counting in the bit probe model ⋮ Integer Representation and Counting in the Bit Probe Model

This page was built for publication: Automata, Languages and Programming