Fundamentals of Computation Theory

DOI10.1007/11537311zbMATH Open1123.68046OpenAlexW2491671784MaRDI QIDQ5492914

Matthias P. Krieger

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

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

Related Items (2)

Title not available (Why is that?) ⋮ Mathematical Foundations of Computer Science 2005

This page was built for publication: Fundamentals of Computation Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5492914)