scientific article; zbMATH DE number 3609651

zbMATH Open0393.03028MaRDI QIDQ4175545FDOQ4175545

Authors: Janos Simon 

Publication date: 1977

Title of this publication is not available (Why is that?)

zbMATH Keywords

hierarchycomplexitypolynomial timeelementary setshigher typesnon-deterministic Turing machinepolynomially bounded quantification

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)

Cited In (2)

• The role of rudimentary relations in complexity theory
• Heirs of box types in polynomially bounded structures

This page was built for publication:

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