Mathematical Foundations of Computer Science 2003

DOI10.1007/B11836MaRDI QIDQ5431353zbMATH OpenOpenAlexFDO

Authors Marcin Rychlik

Publication date 7 December 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b11836

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80)

Recommendations

• The complexity of constraint satisfaction games and QCSP
• \(2^{3}\) quantified Boolean formula games and their complexities
• Generalized probabilistic satisfiability
• Complexity of Unordered CNF Games
• Automated Reasoning

Cited in

(8)

• Tractable unordered 3-CNF games
• A probabilistic representation of exact games on image-algebras
• \(2^{3}\) quantified Boolean formula games and their complexities
• Unordered constraint satisfaction games
• Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games
• scientific article; zbMATH DE number 7445154 (Why is no real title available?)
• Complexity of unordered CNF games
• The complexity of constraint satisfaction games and QCSP

This page was built for publication: Mathematical Foundations of Computer Science 2003

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