×

Found 10 Documents (Results 1–10)

On efficiently solvable cases of quantum \(k\)-SAT. (English) Zbl 1512.68099

Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 38, 16 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Community structure inspired algorithms for SAT and #SAT. (English) Zbl 1471.68322

Heule, Marijn (ed.) et al., Theory and applications of satisfiability testing – SAT 2015. 18th international conference, Austin, TX, USA, September 24–27, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9340, 223-237 (2015).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

Software