Miklós Sántha

Linear Time Algorithm for Quantum 2SAT

2016 · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

A canonical result about satisfiability theory is that the 2-SAT problem can be solved in linear time, despite the NP-hardness of the 3-SAT problem. In the quantum 2-SAT problem, we are given a family of …