On the Relations Between Discrete and Continuous Complexity Theory

DOI10.1002/MALQ.19950410214MaRDI QIDQ4835531zbMATH OpenOpenAlexFDO

Authors Klaus Meer

Publication date 17 December 1995

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19950410214

zbMATH Keywords

complexity modelsexponential-time computations

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Symbolic computation and algebraic computation (68W30)

Recommendations

• Computational complexity of continuous problems
• scientific article; zbMATH DE number 645869
• scientific article; zbMATH DE number 4011940
• scientific article; zbMATH DE number 5130969
• scientific article; zbMATH DE number 3885883
• On relationships between complexity classes of Turing machines
• Qualitative relativizations of complexity classes
• Publication:3487328
• Some Aspects of a Complexity Theory for Continuous Time Systems
• Generalized theorems on relationships among reducibility notions to certain complexity classes

Cited in

(1)

• On the computational structure of the connected components of a hard problem

This page was built for publication: On the Relations Between Discrete and Continuous Complexity Theory

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