×

Found 24 Documents (Results 1–24)

On guarded extensions of MMSNP. (English) Zbl 07787582

Della Vedova, Gianluca (ed.) et al., Unity of logic and computation. 19th conference on computability in Europe, CiE 2023, Batumi, Georgia, July 24–28, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13967, 202-213 (2023).
MSC:  03B70 68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Complexity of conjunctive regular path query homomorphisms. (English) Zbl 1434.68139

Manea, Florin (ed.) et al., Computing with foresight and industry. 15th conference on computability in Europe, CiE 2019, Durham, UK, July 15–19, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11558, 108-119 (2019).
MSC:  68P15 68Q25 68R10
PDFBibTeX XMLCite
Full Text: DOI

Consistency for counting quantifiers. (English) Zbl 1510.68031

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 11, 13 p. (2018).
MSC:  68Q25 03B70 08A70
PDFBibTeX XMLCite
Full Text: DOI

A universal-algebraic proof of the complexity dichotomy for monotone monadic SNP. (English) Zbl 1452.03084

Proceedings of the 2018 33rd annual ACM/IEEE symposium on logic in computer science, LICS 2018, Oxford, UK, July 9–12, 2018. New York, NY: Association for Computing Machinery (ACM). 105-114 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

From complexity to algebra and back: digraph classes, collapsibility, and the PGP. (English) Zbl 1401.68115

Proceedings of the 2015 30th annual ACM/IEEE symposium on logic in computer science, LICS 2015, Kyoto, Japan, July 6–10, 2015. Los Alamitos, CA: IEEE Computer Society (ISBN 978-1-4799-8875-4). 462-474 (2015).
PDFBibTeX XMLCite
Full Text: DOI arXiv

QCSP on partially reflexive cycles – the wavy line of tractability. (English) Zbl 1381.68099

Bulatov, Andrei A. (ed.) et al., Computer science – theory and applications. 8th international computer science symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25–29, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38535-3/pbk). Lecture Notes in Computer Science 7913, 322-333 (2013).
MSC:  68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Constraint satisfaction with counting quantifiers. (English) Zbl 1360.68514

Hirsch, Edward A. (ed.) et al., Computer science – theory and applications. 7th international computer science symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3–7, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30641-9/pbk). Lecture Notes in Computer Science 7353, 253-265 (2012).
MSC:  68Q25 68Q17 68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Formal methods for components and objects. 7th international symposium, FMCO 2008, Sophia Antipolis, France, October 21–23, 2008. Revised lectures. (English) Zbl 1173.68016

Lecture Notes in Computer Science 5751. Berlin: Springer (ISBN 978-3-642-04166-2/pbk). x, 299 p. (2009).
MSC:  68-06 68N30 00B25
PDFBibTeX XMLCite
Full Text: DOI

Hierarchies in fragments of monadic strict NP. (English) Zbl 1150.03315

Cooper, S. Barry (ed.) et al., Computation and logic in the real world. Third conference on computability in Europe, CiE 2007, Siena, Italy, June 18–23, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73000-2/pbk). Lecture Notes in Computer Science 4497, 542-550 (2007).
MSC:  03D05 03B15 05C15
PDFBibTeX XMLCite
Full Text: DOI

Universal structures and the logic of forbidden patterns. (English) Zbl 1225.68094

Ésik, Zoltán (ed.), Computer science logic. 20th international workshop, CSL 2006, 15th annual conference of the EACSL, Szeged, Hungary, September 25–29, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-45458-8/pbk). Lecture Notes in Computer Science 4207, 471-485 (2006).
MSC:  68Q19 03C13
PDFBibTeX XMLCite
Full Text: DOI arXiv

Bounded-degree forbidden patterns problems are constraint satisfaction problems. (English) Zbl 1185.68640

Grigoriev, Dima (ed.) et al., Computer science – theory and applications. First international computer science symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8–12, 2006. Proceedings. Berlin: Springer (ISBN 3-540-34166-8/pbk). Lecture Notes in Computer Science 3967, 159-170 (2006).
MSC:  68T20 03B70 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Towards a trichotomy for quantified \(H\)-coloring. (English) Zbl 1145.68436

Beckmann, Arnold (ed.) et al., Logical approaches to computational barriers. Second conference on computability in Europe, CiE 2006, Swansea, UK, June 30–July 5, 2006. Proceedings. Berlin: Springer (ISBN 3-540-35466-2/pbk). Lecture Notes in Computer Science 3988, 342-352 (2006).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field