×

Found 527 Documents (Results 1–100)

100
MathJax

The hidden subgroup problem for universal algebras. (English) Zbl 1484.08002

Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM). 756-767 (2020).
MSC:  08A30 08A40
PDF BibTeX XML Cite
Full Text: DOI arXiv

A dichotomy theorem for the inverse satisfiability problem. (English) Zbl 07278111

Lokam, Satya (ed.) et al., 37th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2017, IIT Kanpur, India, December 12–14, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 93, Article 39, 14 p. (2018).
MSC:  68N30 68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Time complexity of constraint satisfaction via universal algebra. (English) Zbl 1441.68093

Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 17, 15 p. (2017).
PDF BibTeX XML Cite
Full Text: DOI arXiv

The algebraic dichotomy conjecture for infinite domain constraint satisfaction problems. (English) Zbl 1401.68108

Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5–8, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4391-6). 615-622 (2016).
PDF BibTeX XML Cite
Full Text: DOI arXiv

A gap trichotomy for Boolean constraint problems: extending Schaefer’s theorem. (English) Zbl 1398.68243

Seok-Hee Hong (ed.), 27th international symposium on algorithms and computation, ISAAC 2016, Sydney, Australia, December 12–14, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-026-2). LIPIcs – Leibniz International Proceedings in Informatics 64, Article 36, 12 p. (2016).
MSC:  68Q25 68Q17 90C09
PDF BibTeX XML Cite
Full Text: DOI

A preliminary investigation of satisfiability problems not harder than 1-in-3-SAT. (English) Zbl 1398.68253

Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 64, 14 p. (2016).
MSC:  68Q25 08A70 68Q15
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

all top 3

Software