×

Found 303 Documents (Results 1–100)

Goodbye ioco. (English) Zbl 1524.68196

Jansen, Nils (ed.) et al., A journey from process algebra via timed automata to model learning. Essays dedicated to Frits Vaandrager on the occasion of his 60th birthday. Cham: Springer. Lect. Notes Comput. Sci. 13560, 491-511 (2022).
MSC:  68Q60 68Q85
PDFBibTeX XMLCite
Full Text: DOI

OuterCount: a first-level solution-counter for quantified Boolean formulas. (English) Zbl 07691305

Buzzard, Kevin (ed.) et al., Intelligent computer mathematics. 15th international conference, CICM 2022, Tbilisi, Georgia, September 19–23, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13467, 272-284 (2022).
MSC:  68Vxx
PDFBibTeX XMLCite
Full Text: DOI

Formal methods for NFA equivalence: QBFs, witness extraction, and encoding verification. (English) Zbl 07691303

Buzzard, Kevin (ed.) et al., Intelligent computer mathematics. 15th international conference, CICM 2022, Tbilisi, Georgia, September 19–23, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13467, 241-255 (2022).
MSC:  68Vxx
PDFBibTeX XMLCite
Full Text: DOI

Certified DQBF solving by definition extraction. (English) Zbl 07495594

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 499-517 (2021).
MSC:  68Q25 68R07 68T20
PDFBibTeX XMLCite
Full Text: DOI arXiv

Davis and Putnam meet Henkin: solving DQBF with resolution. (English) Zbl 07495564

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 30-46 (2021).
MSC:  68Q25 68R07 68T20
PDFBibTeX XMLCite
Full Text: DOI

Distributed graph problems through an automata-theoretic Lens. (English) Zbl 07495132

Jurdziński, Tomasz (ed.) et al., Structural information and communication complexity. 28th international colloquium, SIROCCO 2021, Wrocław, Poland, June 28 – July 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12810, 31-49 (2021).
MSC:  68Mxx 68Q11 68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Efficient enumeration of regular expressions for faster regular expression synthesis. (English) Zbl 07495105

Maneth, Sebastian (ed.), Implementation and application of automata. 25th international conference, CIAA 2021, virtual event, July 19–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12803, 65-76 (2021).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

Parametrized universality problems for one-counter nets. (English) Zbl 07559503

Konnov, Igor (ed.) et al., 31st international conference on concurrency theory. CONCUR 2020, September 1–4, 2020, Vienna, Austria, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 171, Article 47, 16 p. (2020).
MSC:  68Q85
PDFBibTeX XMLCite
Full Text: DOI arXiv

The big-O problem for labelled Markov chains and weighted automata. (English) Zbl 07559497

Konnov, Igor (ed.) et al., 31st international conference on concurrency theory. CONCUR 2020, September 1–4, 2020, Vienna, Austria, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 171, Article 41, 19 p. (2020).
MSC:  68Q85
PDFBibTeX XMLCite
Full Text: DOI

Concurrent games with arbitrarily many players (Invited Talk). (English) Zbl 07559372

Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 1, 8 p. (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Computational complexity of synchronization under regular constraints. (English) Zbl 07561707

Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 63, 14 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Exploiting belief bases for building rich epistemic structures. (English) Zbl 07450037

Moss, Lawrence S. (ed.), Proceedings of the seventeenth conference on theoretical aspects of rationality and knowledge, TARK 2019, Toulouse, France, July 17–19, 2019. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 297, 332-353 (2019).
MSC:  68T27
PDFBibTeX XMLCite
Full Text: arXiv Link

Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure. (English) Zbl 07178983

Fontaine, Pascal (ed.), Automated deduction – CADE 27. 27th international conference on automated deduction, Natal, Brazil, August 27–30, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11716, 300-318 (2019).
MSC:  03B35 68V15
PDFBibTeX XMLCite
Full Text: DOI arXiv

Complexity of unordered CNF games. (English) Zbl 1499.68134

Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 9, 12 p. (2018).
MSC:  68Q17 68R05 91A44
PDFBibTeX XMLCite
Full Text: DOI

Canonical models and the complexity of modal team logic. (English) Zbl 1515.03101

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 30, 23 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

The robustness of LWPP and WPP, with an application to graph reconstruction. (English) Zbl 1512.68103

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 51, 14 p. (2018).
MSC:  68Q15 68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Balance problems for integer circuits. (English) Zbl 1510.68023

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 5, 16 p. (2018).
MSC:  68Q06 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Size, cost and capacity: a semantic technique for hard random QBFs. (English) Zbl 1462.68064

Karlin, Anna R. (ed.), 9th innovations in theoretical computer science conference, ITCS 2018, Cambridge, MA, USA, January 11–14, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 94, Article 9, 18 p. (2018).
MSC:  68Q17 03F20
PDFBibTeX XMLCite
Full Text: DOI

Genuine lower bounds for QBF expansion. (English) Zbl 1487.03066

Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 12, 15 p. (2018).
MSC:  03F20 03B35 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Emptiness problems for integer circuits. (English) Zbl 1441.68064

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 33, 14 p. (2017).
MSC:  68Q17 68Q06
PDFBibTeX XMLCite
Full Text: DOI

The complexity of SORE-definability problems. (English) Zbl 1441.68126

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 22, 15 p. (2017).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

Counting problems for Parikh images. (English) Zbl 1441.68124

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 12, 13 p. (2017).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

Unary coded PSPACE-complete languages in \(\mathrm{ASPACE}(\log\log n)\). (English) Zbl 1423.68252

Weil, Pascal (ed.), Computer science – theory and applications. 12th international computer science symposium in Russia, CSR 2017, Kazan, Russia, June 8–12, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10304, 141-153 (2017).
MSC:  68Q45 68Q05 68Q25
PDFBibTeX XMLCite
Full Text: DOI

On quantified propositional logics and the exponential time hierarchy. (English) Zbl 1478.03066

Cantone, Domenico (ed.) et al., Proceedings of the seventh international symposium on games, automata, logics and formal verification, GandALF 2016, Catania, Italy, September 14–16, 2016. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 226, 198-212 (2016).
MSC:  03B70 03D15
PDFBibTeX XMLCite
Full Text: arXiv Link

NP completeness conditions for verifying the consistency of several kinds of systems of linear Diophantine discongruences. (English. Russian original) Zbl 1420.68094

Vestn. St. Petersbg. Univ., Math. 49, No. 1, 18-22 (2016); translation from Vestn. St-Peterbg. Univ., Ser. I, Mat. Mekh. Astron. 3(61), No. 1, 26-31 (2016).
MSC:  68Q17 11D04
PDFBibTeX XMLCite
Full Text: DOI

Problems on finite automata and the exponential time hypothesis. (English) Zbl 1475.68152

Han, Yo-Sub (ed.) et al., Implementation and application of automata. 21st international conference, CIAA 2016, Seoul, South Korea, July 19–22, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9705, 89-100 (2016).
MSC:  68Q45 68Q17 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software