scientific article

zbMATH Open1224.03023MaRDI QIDQ3003717

Jordan Zashev

Publication date: 30 May 2011

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

zbMATH Keywords

time complexityalgebraic recursion theoryoperative space

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Abstract and axiomatic computability and recursion theory (03D75)

Related Items (2)

Title not available (Why is that?) ⋮ Operational complexity and pumping lemmas

Recommendations

• Title not available (Why is that?) 👍 👎
• Time-space tradeoffs in algebraic complexity theory 👍 👎
• Operational complexity and pumping lemmas 👍 👎
• On the computational complexity of finite operations 👍 👎
• Complexity theory for operators in analysis 👍 👎
• Complexity Theory for Operators in Analysis 👍 👎
• Operative vs. combinatory spaces 👍 👎
• Complexity of Operators on Compact Sets 👍 👎
• Parameterized and Exact Computation 👍 👎

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 Q3003717)