Computational complexity in algebraic systems

MaRDI QIDQ5476780zbMATH OpenFDO

Authors Alexander Rybalov

Publication date 18 July 2006

Full work available at URL https://eudml.org/doc/52661, http://www.emis.de/journals/SMZ/2004/06/1365.htm

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

BSS-machinescomplexity of computationsgeneralized computability

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Abstract and axiomatic computability and recursion theory (03D75) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Toward a generalized computability theory
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Complexity classes and completeness in algebraic geometry
• A survey on real structural complexity theory
• scientific article; zbMATH DE number 66626

Cited in

(15)

• Complexity classes and completeness in algebraic geometry
• Fields of algebraic numbers computable in polynomial time. II
• Computational complexity of learning algebraic varieties
• scientific article; zbMATH DE number 3848613 (Why is no real title available?)
• scientific article; zbMATH DE number 3872682 (Why is no real title available?)
• On computational complexity of Clifford algebra
• scientific article; zbMATH DE number 3936520 (Why is no real title available?)
• scientific article; zbMATH DE number 3933053 (Why is no real title available?)
• On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae
• scientific article; zbMATH DE number 1302879 (Why is no real title available?)
• Computation over algebraic structures and a classification of undecidable problems
• scientific article; zbMATH DE number 1827830 (Why is no real title available?)
• Decidability of classes of algebraic systems in polynomial time
• Algebraic structures computable without delay
• Polynomial equivalence of two models of computations in algebraic structures

This page was built for publication: Computational complexity in algebraic systems

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