×

Found 58 Documents (Results 1–58)

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

A unified approach to structural limits and limits of graphs with bounded tree-depth. (English) Zbl 1491.03004

Memoirs of the American Mathematical Society 1272. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-4065-7/pbk; 978-1-4704-5652-8/ebook). v, 108 p. (2020).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Relating structure and power: comonadic semantics for computational resources. (English) Zbl 1509.03098

Ghica, Dan R. (ed.) et al., 27th EACSL annual conference on computer science logic, CSL 2018, Birmingham, United Kingdom, September 4–8, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 119, Article 2, 17 p. (2018).
MSC:  03C13 18C15 18C50
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

Relating structure and power: comonadic semantics for computational resources (extended abstract). (English) Zbl 1509.03096

Cîrstea, Corina (ed.), Coalgebraic methods in computer science. 14th IFIP WG 1.3 international workshop, CMCS 2018, colocated with ETAPS 2018, Thessaloniki, Greece, April 14–15, 2018. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 11202, 1-5 (2018).
MSC:  03C13 18C15 18C50
PDFBibTeX XMLCite
Full Text: DOI arXiv

Is the optimal implementation inefficient? Elementarily not. (English) Zbl 1434.68087

Miller, Dale (ed.), 2nd international conference on formal structures for computation and deduction. FSCD 2017, Oxford, UK, September 3–9, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 84, Article 17, 16 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

An improved homomorphism preservation theorem from lower bounds in circuit complexity. (English) Zbl 1402.68077

Papadimitriou, Christos H. (ed.), 8th innovations in theoretical computer science conference, ITCS 2017, Berkeley, CA, USA, January 9–11, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-029-3). LIPIcs – Leibniz International Proceedings in Informatics 67, Article 27, 17 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

The complexity of counting quantifiers on equality languages. (English) Zbl 1476.68113

Beckmann, Arnold (ed.) et al., Pursuit of the universal. 12th conference on computability in Europe, CiE 2016, Paris, France, June 27 – July 1, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9709, 333-342 (2016).
MSC:  68Q25 03B70
PDFBibTeX XMLCite
Full Text: DOI Link

Circuit satisfiability and constraint satisfaction around Skolem arithmetic. (English) Zbl 1475.68123

Beckmann, Arnold (ed.) et al., Pursuit of the universal. 12th conference on computability in Europe, CiE 2016, Paris, France, June 27 – July 1, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9709, 323-332 (2016).
PDFBibTeX XMLCite
Full Text: DOI Link

Constraint satisfaction problems over the integers with successor. (English) Zbl 1440.68111

Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9134, 256-267 (2015).
MSC:  68Q25 03B70
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

First-order model checking problems parameterized by the model. (English) Zbl 1142.68439

Beckmann, Arnold (ed.) et al., Logic and theory of algorithms. 4th conference on computability in Europe, CiE 2008, Athens, Greece, June 15–20, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69405-2/pbk). Lecture Notes in Computer Science 5028, 417-427 (2008).
MSC:  68Q60 03B70
PDFBibTeX XMLCite
Full Text: DOI

Unary automatic graphs: An algorithmic perspective. (English) Zbl 1139.03313

Agrawal, Manindra (ed.) et al., Theory and applications of models of computation. 5th international conference, TAMC 2008, Xi’an, China, April 25–29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79227-7/pbk). Lecture Notes in Computer Science 4978, 542-553 (2008).
MSC:  03D05 68Q45 68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Software