Automata, Languages and Programming
From MaRDI portal
Publication:5716772
DOI10.1007/11523468zbMath1082.68556OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716772
Ehsan Chiniforooshan, Arash Farzan, Mehdi Mirzazadeh
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
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
Related Items