Generalized satisfiability problems via operator assignments

DOI10.1007/978-3-662-55751-8_6MaRDI QIDQ5915756zbMATH OpenOpenAlexFDO

Authors Albert Atserias, Phokion G. Kolaitis, Simone Severini

Publication date 22 November 2017

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2117/134848

Mathematics Subject Classification ID

Operators on Hilbert spaces (general) (47B02) Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07)

Recommendations

• Generalized satisfiability problems via operator assignments
• Gap theorems for robust satisfiability: Boolean CSPs and beyond
• Complexity of generalized satisfiability counting problems
• Computational Complexity of Quantum Satisfiability
• Classical vs quantum satisfiability in linear constraint systems modulo an integer

Cited in

(4)

• Quantum logic is undecidable
• Generalized Davis-Putnam and satisfiability problems in mathematics
• Classical vs quantum satisfiability in linear constraint systems modulo an integer
• Generalized satisfiability problems via operator assignments

This page was built for publication: Generalized satisfiability problems via operator assignments

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