Fundamentals of Computation Theory

DOI10.1007/11537311zbMath1121.68343OpenAlexW2491671784MaRDI QIDQ5492922

Rahul Tripathi, Holger Spakowski

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

zbMATH Keywords

alternating Turing machines

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (3)

Languages polylog-time reducible to dot-depth 1/2 ⋮ Perfect correspondences between dot-depth and polynomial-time hierarchies ⋮ Machines that can output empty words

This page was built for publication: Fundamentals of Computation Theory