Suchergebnisse - "algorithms over general structures"

A survey on real structural complexity theory

Autoren: Meer, Klaus Michaux, Christian

Quelle: Bull. Belg. Math. Soc. Simon Stevin 4, no. 1 (1997), 113-148

Schlagwörter: Research exposition (monographs, survey articles) pertaining to computer science, boolean part, Julia set, 0102 computer and information sciences, 68Q15, algorithms, 01 natural sciences, Real number models, Complexity classes (hierarchies, relations among complexity classes, etc.), 03D80, 0101 mathematics, Complexity of computation (including implicit computational complexity), Recursively (computably) enumerable sets and degrees, recursion theory, 68Q05, Models of computation (Turing machines, etc.), halting problem, structure of finite type, NP-completeness, complexity classes, real number models, algorithms over general structures, continuous domain, recursively enumerable, model theory, undecidability, 03D15, P versus NP, analogs to Turing machine

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: https://zbmath.org/1260657
https://projecteuclid.org/download/pdf_1/euclid.bbms/1105730626
http://www.emis.de/journals/BMMSS/Bulletin/bul971/meer.pdf
https://projecteuclid.org/journals/bulletin-of-the-belgian-mathematical-society-simon-stevin/volume-4/issue-1/A-survey-on-real-structural-complexity-theory/10.36045/bbms/1105730626.full
http://www.kurims.kyoto-u.ac.jp/EMIS/journals/BBMS/Bulletin/bul971/meer.pdf
http://projecteuclid.org/euclid.bbms/1105730626