Descriptive set theory and Boolean complexity theory

DOI10.1016/S0764-4442(97)89481-5MaRDI QIDQ4217016zbMATH OpenOpenAlexFDO

Authors Claude Sureson

Publication date 3 November 1998

Published in Comptes Rendus de l'Académie des Sciences - Series I - Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0764-4442(97)89481-5

zbMATH Keywords

Boolean complexity theory

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 1786653
• scientific article; zbMATH DE number 4002078
• scientific article; zbMATH DE number 3938569
• Some descriptive-set-theoretical problems in complexity theory

Cited in

(6)

• Some descriptive-set-theoretical problems in complexity theory
• Boole vs Wadge: comparing two basic tools of descriptive set theory
• scientific article; zbMATH DE number 5910780 (Why is no real title available?)
• scientific article; zbMATH DE number 3938569 (Why is no real title available?)
• scientific article; zbMATH DE number 1786653 (Why is no real title available?)
• Descriptive set theoretic methods in automata theory. Decidability and topological complexity

This page was built for publication: Descriptive set theory and Boolean complexity theory

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