On the complexity of decision using destinies in \(H\)-bounded structures

DOI10.1016/j.tcs.2004.03.024zbMath1070.68039OpenAlexW2050613068MaRDI QIDQ1885032

Annie Chateau

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.03.024

zbMATH Keywords

ComplexityDecision algorithmDecidable structuresDestiniesH-bounded

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• The monadic theory of order
• The computational complexity of logical theories
• Modest theory of short chains. I
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On direct products of theories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of decision using destinies in \(H\)-bounded structures