On the complexity of the ℰ2 Grzegorczyk class

DOI10.1515/DMA.2010.003zbMATH Open1217.03027MaRDI QIDQ3586259

S. S. Marchenkov

Publication date: 6 September 2010

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

zbMATH Keywords

Could not fetch data.

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites Work

• Classes of languages and linear-bounded automata

Related Items (1)

Near-polynomial recursive sequences with algorithmically unsolvable problems

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On the Graver complexity of codimension \(2\) matrices 👍 👎
• On the Gröbner complexity of matrices 👍 👎
• A generalized Grzegorczyk hierarchy and low complexity classes 👍 👎
• On the complexity of the computation of certain classes of polynomials of several variables 👍 👎
• On the complexity of computing Gröbner bases in characteristic 2 👍 👎
• Complexity classes and completeness in algebraic geometry 👍 👎
• Complexity of conjugacy classes of \(A(\mathbb Q)\) 👍 👎
• The complexity to compute the Euler characteristic of complex varieties 👍 👎

This page was built for publication: On the complexity of the ℰ2 Grzegorczyk class

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