Goerigk, Marc; Lendl, Stefan; Wulf, Lasse On the complexity of robust multi-stage problems with discrete recourse. (English) Zbl 07782006 Discrete Appl. Math. 343, 355-370 (2024). MSC: 90Cxx 68Qxx 90Bxx PDFBibTeX XMLCite \textit{M. Goerigk} et al., Discrete Appl. Math. 343, 355--370 (2024; Zbl 07782006) Full Text: DOI arXiv
Holzer, Markus; Rauch, Christian Computational complexity of reversible reaction systems. (English) Zbl 07786594 Kutrib, Martin (ed.) et al., Reversible computation. 15th international conference, RC 2023, Giessen, Germany, July 18–19, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13960, 40-54 (2023). MSC: 68Q09 68Q10 81P68 PDFBibTeX XMLCite \textit{M. Holzer} and \textit{C. Rauch}, Lect. Notes Comput. Sci. 13960, 40--54 (2023; Zbl 07786594) Full Text: DOI
Kurucz, Agi; Ryzhikov, Vladislav; Savateev, Yury; Zakharyaschev, Michael Deciding FO-rewritability of regular languages and ontology-mediated queries in linear temporal logic. (English) Zbl 07732093 J. Artif. Intell. Res. (JAIR) 76, 645-703 (2023). MSC: 68Txx PDFBibTeX XMLCite \textit{A. Kurucz} et al., J. Artif. Intell. Res. (JAIR) 76, 645--703 (2023; Zbl 07732093) Full Text: DOI arXiv
Kappé, Tobias Completeness and the finite model property for Kleene algebra, reconsidered. (English) Zbl 07728638 Glück, Roland (ed.) et al., Relational and algebraic methods in computer science. 20th international conference, RAMiCS 2023, Augsburg, Germany, April 3–6, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13896, 158-175 (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{T. Kappé}, Lect. Notes Comput. Sci. 13896, 158--175 (2023; Zbl 07728638) Full Text: DOI arXiv
Sankaran, Abhisekh Feferman-vaught decompositions for prefix classes of first order logic. (English) Zbl 07727823 J. Logic Lang. Inf. 32, No. 1, 147-174 (2023). MSC: 03C13 03C40 03C52 05C05 05C38 05C62 05C69 05C75 PDFBibTeX XMLCite \textit{A. Sankaran}, J. Logic Lang. Inf. 32, No. 1, 147--174 (2023; Zbl 07727823) Full Text: DOI arXiv
Antonelli, Melissa; Dal Lago, Ugo; Pistone, Paolo On counting propositional logic and Wagner’s hierarchy. (English) Zbl 07699965 Theor. Comput. Sci. 966-967, Article ID 113928, 21 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. Antonelli} et al., Theor. Comput. Sci. 966--967, Article ID 113928, 21 p. (2023; Zbl 07699965) Full Text: DOI
Chang, Yi-Jun; Studený, Jan; Suomela, Jukka Distributed graph problems through an automata-theoretic lens. (English) Zbl 07661886 Theor. Comput. Sci. 951, Article ID 113710, 22 p. (2023). MSC: 68W15 68Q25 68Q45 68R10 PDFBibTeX XMLCite \textit{Y.-J. Chang} et al., Theor. Comput. Sci. 951, Article ID 113710, 22 p. (2023; Zbl 07661886) Full Text: DOI
Kwisthout, Johan Motivating explanations in Bayesian networks using MAP-independence. (English) Zbl 07639175 Int. J. Approx. Reasoning 153, 18-28 (2023). MSC: 68T37 PDFBibTeX XMLCite \textit{J. Kwisthout}, Int. J. Approx. Reasoning 153, 18--28 (2023; Zbl 07639175) Full Text: DOI arXiv
Fichte, Johannes K.; Hecher, Markus; Morak, Michael; Thier, Patrick; Woltran, Stefan Solving projected model counting by utilizing treewidth and its limits. (English) Zbl 07638288 Artif. Intell. 314, Article ID 103810, 29 p. (2023). MSC: 68Txx PDFBibTeX XMLCite \textit{J. K. Fichte} et al., Artif. Intell. 314, Article ID 103810, 29 p. (2023; Zbl 07638288) Full Text: DOI
Larsen, Kim G.; Schilling, Christian; Srba, Jiří Simulation relations and applications in formal methods. (English) Zbl 1528.68188 Raskin, Jean-François (ed.) et al., Principles of systems design. Essays dedicated to Thomas A. Henzinger on the occasion of his 60th birthday. Cham: Springer. Lect. Notes Comput. Sci. 13660, 272-291 (2022). MSC: 68Q45 68Q60 68Q85 PDFBibTeX XMLCite \textit{K. G. Larsen} et al., Lect. Notes Comput. Sci. 13660, 272--291 (2022; Zbl 1528.68188) Full Text: DOI
Tretmans, Jan; Janssen, Ramon 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 \textit{J. Tretmans} and \textit{R. Janssen}, Lect. Notes Comput. Sci. 13560, 491--511 (2022; Zbl 1524.68196) Full Text: DOI
Shukla, Ankit; Möhle, Sibylle; Kauers, Manuel; Seidl, Martina 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 \textit{A. Shukla} et al., Lect. Notes Comput. Sci. 13467, 272--284 (2022; Zbl 07691305) Full Text: DOI
Hemaspaandra, Edith; Narváez, David E. 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 \textit{E. Hemaspaandra} and \textit{D. E. Narváez}, Lect. Notes Comput. Sci. 13467, 241--255 (2022; Zbl 07691303) Full Text: DOI
Berndt, Sebastian; Liśkiewicz, Maciej; Lutter, Matthias; Reischuk, Rüdiger Learning residual alternating automata. (English) Zbl 07629159 Inf. Comput. 289, Part A, Article ID 104981, 22 p. (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{S. Berndt} et al., Inf. Comput. 289, Part A, Article ID 104981, 22 p. (2022; Zbl 07629159) Full Text: DOI
Chistikov, Dmitry; Kiefer, Stefan; Murawski, Andrzej S.; Purser, David The big-O problem. (English) Zbl 07566053 Log. Methods Comput. Sci. 18, No. 1, Paper No. 40, 50 p. (2022). MSC: 03B70 68-XX PDFBibTeX XMLCite \textit{D. Chistikov} et al., Log. Methods Comput. Sci. 18, No. 1, Paper No. 40, 50 p. (2022; Zbl 07566053) Full Text: arXiv Link
Latkin, Ivan Vasil’evich The recognition complexity of decidable theories. (English) Zbl 1499.03031 Eurasian Math. J. 13, No. 1, 44-68 (2022). MSC: 03D15 03C07 PDFBibTeX XMLCite \textit{I. V. Latkin}, Eurasian Math. J. 13, No. 1, 44--68 (2022; Zbl 1499.03031) Full Text: DOI MNR
Wintenberg, Andrew; Blischke, Matthew; Lafortune, Stéphane; Ozay, Necmiye A general language-based framework for specifying and verifying notions of opacity. (English) Zbl 1492.93118 Discrete Event Dyn. Syst. 32, No. 2, 253-289 (2022). MSC: 93C65 68Q45 PDFBibTeX XMLCite \textit{A. Wintenberg} et al., Discrete Event Dyn. Syst. 32, No. 2, 253--289 (2022; Zbl 1492.93118) Full Text: DOI arXiv
Mansutti, Alessio An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning. (English) Zbl 1506.03077 Inf. Comput. 285, Part B, Article ID 104911, 43 p. (2022). MSC: 03B70 03B45 68Q17 PDFBibTeX XMLCite \textit{A. Mansutti}, Inf. Comput. 285, Part B, Article ID 104911, 43 p. (2022; Zbl 1506.03077) Full Text: DOI
Köcher, Chris Rational, recognizable, and aperiodic partially lossy queue languages. (English) Zbl 1509.68135 Int. J. Algebra Comput. 32, No. 3, 483-528 (2022). Reviewer: Roger Villemaire (Montréal) MSC: 68Q45 03D05 20M35 68Q70 PDFBibTeX XMLCite \textit{C. Köcher}, Int. J. Algebra Comput. 32, No. 3, 483--528 (2022; Zbl 1509.68135) Full Text: DOI
Nguyen, Danny; Pak, Igor Short Presburger arithmetic is hard. (English) Zbl 07516620 SIAM J. Comput. 51, No. 2, STOC17-1-STOC17-30 (2022). MSC: 68Q17 68Q25 03D15 90C10 03B10 03B70 PDFBibTeX XMLCite \textit{D. Nguyen} and \textit{I. Pak}, SIAM J. Comput. 51, No. 2, STOC17--1-STOC17--30 (2022; Zbl 07516620) Full Text: DOI arXiv
Nabli, Adel; Carvalho, Margarida; Hosteins, Pierre Complexity of the multilevel critical node problem. (English) Zbl 1484.91085 J. Comput. Syst. Sci. 127, 122-145 (2022). MSC: 91A43 91A20 91A68 68Q17 PDFBibTeX XMLCite \textit{A. Nabli} et al., J. Comput. Syst. Sci. 127, 122--145 (2022; Zbl 1484.91085) Full Text: DOI arXiv
van Benthem, Johan; Mierzewski, Krzysztof; Zaffora Blando, Francesca The modal logic of stepwise removal. (English) Zbl 07493109 Rev. Symb. Log. 15, No. 1, 36-63 (2022). MSC: 03B45 03B42 PDFBibTeX XMLCite \textit{J. van Benthem} et al., Rev. Symb. Log. 15, No. 1, 36--63 (2022; Zbl 07493109) Full Text: DOI arXiv
Wolf, Petra From decidability to undecidability by considering regular sets of instances. (English) Zbl 1515.68169 Theor. Comput. Sci. 899, 25-38 (2022). MSC: 68Q45 68R01 PDFBibTeX XMLCite \textit{P. Wolf}, Theor. Comput. Sci. 899, 25--38 (2022; Zbl 1515.68169) Full Text: DOI arXiv
Havelund, Klaus; Omer, Moran; Peled, Doron Monitoring first-order interval logic. (English) Zbl 1522.68321 Calinescu, Radu (ed.) et al., Software engineering and formal methods. 19th international conference, SEFM 2021, virtual event, December 6–10, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13085, 66-83 (2021). MSC: 68Q60 03B44 PDFBibTeX XMLCite \textit{K. Havelund} et al., Lect. Notes Comput. Sci. 13085, 66--83 (2021; Zbl 1522.68321) Full Text: DOI
Boucher, Steve; Villemaire, Roger Quantified Boolean solving for achievement games. (English) Zbl 1520.91006 Edelkamp, Stefan (ed.) et al., KI 2021: advances in artificial intelligence. 44th German conference on AI, virtual event, September 27 – October 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12873, 30-43 (2021). MSC: 91A05 PDFBibTeX XMLCite \textit{S. Boucher} and \textit{R. Villemaire}, Lect. Notes Comput. Sci. 12873, 30--43 (2021; Zbl 1520.91006) Full Text: DOI
Hoffmann, Stefan State complexity of projection on languages recognized by permutation automata and commuting letters. (English) Zbl 07498726 Moreira, Nelma (ed.) et al., Developments in language theory. 25th international conference, DLT 2021, Porto, Portugal, August 16–20, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12811, 192-203 (2021). MSC: 68Q45 PDFBibTeX XMLCite \textit{S. Hoffmann}, Lect. Notes Comput. Sci. 12811, 192--203 (2021; Zbl 07498726) Full Text: DOI arXiv
Asarin, Eugene; Ferrère, Thomas; Ničković, Dejan; Ulus, Dogan On the complexity of timed pattern matching. (English) Zbl 07497998 Dima, Catalin (ed.) et al., Formal modeling and analysis of timed systems. 19th international conference, FORMATS 2021, Paris, France, August 24–26, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12860, 15-31 (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{E. Asarin} et al., Lect. Notes Comput. Sci. 12860, 15--31 (2021; Zbl 07497998) Full Text: DOI
Reichl, Franz-Xaver; Slivovsky, Friedrich; Szeider, Stefan 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 \textit{F.-X. Reichl} et al., Lect. Notes Comput. Sci. 12831, 499--517 (2021; Zbl 07495594) Full Text: DOI arXiv
Blinkhorn, Joshua; Peitl, Tomáš; Slivovsky, Friedrich 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 \textit{J. Blinkhorn} et al., Lect. Notes Comput. Sci. 12831, 30--46 (2021; Zbl 07495564) Full Text: DOI
Chang, Yi-Jun; Studený, Jan; Suomela, Jukka 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 \textit{Y.-J. Chang} et al., Lect. Notes Comput. Sci. 12810, 31--49 (2021; Zbl 07495132) Full Text: DOI arXiv
Kim, Su-Hyeon; Im, Hyeonseung; Ko, Sang-Ki 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 \textit{S.-H. Kim} et al., Lect. Notes Comput. Sci. 12803, 65--76 (2021; Zbl 07495105) Full Text: DOI
Gruber, Hermann; Holzer, Markus; Kutrib, Martin Descriptional complexity of regular languages. (English) Zbl 1510.68036 Pin, Jean-Éric (ed.), Handbook of automata theory. Volume I. Theoretical foundations. Berlin: European Mathematical Society (EMS). 411-457 (2021). MSC: 68Q45 PDFBibTeX XMLCite \textit{H. Gruber} et al., in: Handbook of automata theory. Volume I. Theoretical foundations. Berlin: European Mathematical Society (EMS). 411--457 (2021; Zbl 1510.68036) Full Text: DOI
Lombardy, Sylvain; Mairesse, Jean Max-plus automata. (English) Zbl 1510.68039 Pin, Jean-Éric (ed.), Handbook of automata theory. Volume I. Theoretical foundations. Berlin: European Mathematical Society (EMS). 151-188 (2021). MSC: 68Q45 15A80 16Y60 68Q70 PDFBibTeX XMLCite \textit{S. Lombardy} and \textit{J. Mairesse}, in: Handbook of automata theory. Volume I. Theoretical foundations. Berlin: European Mathematical Society (EMS). 151--188 (2021; Zbl 1510.68039) Full Text: DOI
Balun, Jiří; Masopust, Tomáš Comparing the notions of opacity for discrete-event systems. (English) Zbl 1480.93256 Discrete Event Dyn. Syst. 31, No. 4, 553-582 (2021). MSC: 93C65 68Q45 PDFBibTeX XMLCite \textit{J. Balun} and \textit{T. Masopust}, Discrete Event Dyn. Syst. 31, No. 4, 553--582 (2021; Zbl 1480.93256) Full Text: DOI arXiv
Balun, Jiří; Masopust, Tomáš On verification of D-detectability for discrete event systems. (English) Zbl 1480.93255 Automatica 133, Article ID 109884, 10 p. (2021). MSC: 93C65 93B53 PDFBibTeX XMLCite \textit{J. Balun} and \textit{T. Masopust}, Automatica 133, Article ID 109884, 10 p. (2021; Zbl 1480.93255) Full Text: DOI arXiv
Havlena, Vojtěch; Holík, Lukáš; Lengál, Ondřej; Vojnar, Tomáš Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure. (English) Zbl 07433025 J. Autom. Reasoning 65, No. 7, 971-999 (2021). MSC: 68V15 PDFBibTeX XMLCite \textit{V. Havlena} et al., J. Autom. Reasoning 65, No. 7, 971--999 (2021; Zbl 07433025) Full Text: DOI
Chalki, Aggeliki; Koutras, Costas D.; Zikos, Yorgos A note on the complexity of S4.2. (English) Zbl 1515.03090 J. Appl. Non-Class. Log. 31, No. 2, 108-129 (2021). MSC: 03B45 03D15 68Q17 PDFBibTeX XMLCite \textit{A. Chalki} et al., J. Appl. Non-Class. Log. 31, No. 2, 108--129 (2021; Zbl 1515.03090) Full Text: DOI
Miyazaki, Takayuki; Minamide, Yasuhiko Context-free grammars with lookahead. (English) Zbl 07405989 Leporati, Alberto (ed.) et al., Language and automata theory and applications. 15th international conference, LATA 2021, Milan, Italy, March 1–5, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12638, 213-225 (2021). MSC: 68Q45 PDFBibTeX XMLCite \textit{T. Miyazaki} and \textit{Y. Minamide}, Lect. Notes Comput. Sci. 12638, 213--225 (2021; Zbl 07405989) Full Text: DOI
Masopust, Tomáš; Krötzsch, Markus Partially ordered automata and piecewise testability. (English) Zbl 07350780 Log. Methods Comput. Sci. 17, No. 2, Paper No. 14, 36 p. (2021). MSC: 03B70 68-XX PDFBibTeX XMLCite \textit{T. Masopust} and \textit{M. Krötzsch}, Log. Methods Comput. Sci. 17, No. 2, Paper No. 14, 36 p. (2021; Zbl 07350780) Full Text: arXiv Link
Bhattacharyya, Arnab; Gupta, Ashutosh; Kuppusamy, Lakshmanan; Mani, Somya; Shukla, Ankit; Srivas, Mandayam; Thattai, Mukund A formal methods approach to predicting new features of the eukaryotic vesicle traffic system. (English) Zbl 1512.92022 Acta Inf. 58, No. 1-2, 57-93 (2021). MSC: 92C37 05C90 68T20 PDFBibTeX XMLCite \textit{A. Bhattacharyya} et al., Acta Inf. 58, No. 1--2, 57--93 (2021; Zbl 1512.92022) Full Text: DOI
Almagor, Shaull; Boker, Udi; Hofman, Piotr; Totzke, Patrick 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 \textit{S. Almagor} et al., LIPIcs -- Leibniz Int. Proc. Inform. 171, Article 47, 16 p. (2020; Zbl 07559503) Full Text: DOI arXiv
Chistikov, Dmitry; Kiefer, Stefan; Murawski, Andrzej S.; Purser, David 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 \textit{D. Chistikov} et al., LIPIcs -- Leibniz Int. Proc. Inform. 171, Article 41, 19 p. (2020; Zbl 07559497) Full Text: DOI
Bertrand, Nathalie 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 \textit{N. Bertrand}, LIPIcs -- Leibniz Int. Proc. Inform. 170, Article 1, 8 p. (2020; Zbl 07559372) Full Text: DOI
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Spakowski, Holger; Watanabe, Osamu The robustness of LWPP and WPP, with an application to graph reconstruction. (English) Zbl 1503.68074 Comput. Complexity 29, No. 2, Paper No. 7, 49 p. (2020). MSC: 68Q15 68R10 PDFBibTeX XMLCite \textit{E. Hemaspaandra} et al., Comput. Complexity 29, No. 2, Paper No. 7, 49 p. (2020; Zbl 1503.68074) Full Text: DOI Link
Johnson, Robert F.; Winfree, Erik Verifying polymer reaction networks using bisimulation. (English) Zbl 1460.68039 Theor. Comput. Sci. 843, 84-114 (2020). MSC: 68Q07 68Q60 92C40 92E20 PDFBibTeX XMLCite \textit{R. F. Johnson} and \textit{E. Winfree}, Theor. Comput. Sci. 843, 84--114 (2020; Zbl 1460.68039) Full Text: DOI Link
Bridoux, Florian; Gadouleau, Maximilien; Theyssier, Guillaume Expansive automata networks. (English) Zbl 1460.68050 Theor. Comput. Sci. 843, 25-44 (2020). MSC: 68Q45 68Q17 68Q80 PDFBibTeX XMLCite \textit{F. Bridoux} et al., Theor. Comput. Sci. 843, 25--44 (2020; Zbl 1460.68050) Full Text: DOI arXiv
Barth, Dominik; Beck, Moritz; Dose, Titus; Glaßer, Christian; Michler, Larissa; Technau, Marc Emptiness problems for integer circuits. (English) Zbl 1441.68063 Theor. Comput. Sci. 824-825, 11-35 (2020). MSC: 68Q17 68Q06 PDFBibTeX XMLCite \textit{D. Barth} et al., Theor. Comput. Sci. 824--825, 11--35 (2020; Zbl 1441.68063) Full Text: DOI Link
Beyersdorff, Olaf; Blinkhorn, Joshua Lower bound techniques for QBF expansion. (English) Zbl 1471.03081 Theory Comput. Syst. 64, No. 3, 400-421 (2020). Reviewer: Ariel Germán Fernández (Buenos Aires) MSC: 03F20 PDFBibTeX XMLCite \textit{O. Beyersdorff} and \textit{J. Blinkhorn}, Theory Comput. Syst. 64, No. 3, 400--421 (2020; Zbl 1471.03081) Full Text: DOI
Goncharov, Sergeĭ; Ospichev, Sergeĭ; Ponomaryov, Denis; Sviridenko, Dmitriĭ The expressiveness of looping terms in the semantic programming. (English) Zbl 1445.68053 Sib. Èlektron. Mat. Izv. 17, 380-394 (2020). Reviewer: Arne Meier (Hannover) MSC: 68N30 03B70 68Q17 68Q25 68Q60 PDFBibTeX XMLCite \textit{S. Goncharov} et al., Sib. Èlektron. Mat. Izv. 17, 380--394 (2020; Zbl 1445.68053) Full Text: DOI arXiv
Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian Using decomposition-parameters for QBF: mind the prefix! (English) Zbl 1435.68123 J. Comput. Syst. Sci. 110, 1-21 (2020). MSC: 68Q27 68R07 68T20 PDFBibTeX XMLCite \textit{E. Eiben} et al., J. Comput. Syst. Sci. 110, 1--21 (2020; Zbl 1435.68123) Full Text: DOI Link
Fernau, Henning; Gusev, Vladimir V.; Hoffmann, Stefan; Holzer, Markus; Volkov, Mikhail V.; Wolf, Petra 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 \textit{H. Fernau} et al., LIPIcs -- Leibniz Int. Proc. Inform. 138, Article 63, 14 p. (2019; Zbl 07561707) Full Text: DOI
Lorini, Emiliano 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 \textit{E. Lorini}, Electron. Proc. Theor. Comput. Sci. (EPTCS) 297, 332--353 (2019; Zbl 07450037) Full Text: arXiv Link
Wimmer, Ralf; Scholl, Christoph; Becker, Bernd The (D)QBF preprocessor HQSpre – underlying theory and its implementation. (English) Zbl 1484.68225 J. Satisf. Boolean Model. Comput. 11, 3-52 (2019). MSC: 68T20 PDFBibTeX XMLCite \textit{R. Wimmer} et al., J. Satisf. Boolean Model. Comput. 11, 3--52 (2019; Zbl 1484.68225) Full Text: DOI
Amendola, Giovanni; Ricca, Francesco; Truszczynski, Miroslaw Beyond NP: quantifying over answer sets. (English) Zbl 1434.68068 Theory Pract. Log. Program. 19, No. 5-6, 705-721 (2019). MSC: 68N17 68Q15 PDFBibTeX XMLCite \textit{G. Amendola} et al., Theory Pract. Log. Program. 19, No. 5--6, 705--721 (2019; Zbl 1434.68068) Full Text: DOI arXiv
Havlena, Vojtěch; Holík, Lukáš; Lengál, Ondřej; Vojnar, Tomáš 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 \textit{V. Havlena} et al., Lect. Notes Comput. Sci. 11716, 300--318 (2019; Zbl 07178983) Full Text: DOI arXiv
Maslennikova, Marina Reset complexity of ideal languages over a binary alphabet. (English) Zbl 1427.68150 Int. J. Found. Comput. Sci. 30, No. 6-7, 1177-1196 (2019). MSC: 68Q45 68Q17 PDFBibTeX XMLCite \textit{M. Maslennikova}, Int. J. Found. Comput. Sci. 30, No. 6--7, 1177--1196 (2019; Zbl 1427.68150) Full Text: DOI
Dose, Titus Balance problems for integer circuits. (English) Zbl 1436.68134 Theor. Comput. Sci. 799, 124-139 (2019). MSC: 68Q25 68Q06 68Q17 PDFBibTeX XMLCite \textit{T. Dose}, Theor. Comput. Sci. 799, 124--139 (2019; Zbl 1436.68134) Full Text: DOI Link
Freydenberger, Dominik D. A logic for document spanners. (English) Zbl 1430.68081 Theory Comput. Syst. 63, No. 7, 1679-1754 (2019). MSC: 68P15 03B70 68P20 68Q45 PDFBibTeX XMLCite \textit{D. D. Freydenberger}, Theory Comput. Syst. 63, No. 7, 1679--1754 (2019; Zbl 1430.68081) Full Text: DOI
Beyersdorff, Olaf; Blinkhorn, Joshua; Chew, Leroy; Schmidt, Renate; Suda, Martin Reinterpreting dependency schemes: soundness meets incompleteness in DQBF. (English) Zbl 1468.03008 J. Autom. Reasoning 63, No. 3, 597-623 (2019). MSC: 03B35 03F20 PDFBibTeX XMLCite \textit{O. Beyersdorff} et al., J. Autom. Reasoning 63, No. 3, 597--623 (2019; Zbl 1468.03008) Full Text: DOI
Baartse, Martijn; Meer, Klaus Interactive proofs and a Shamir-like result for real number computations. (English) Zbl 1429.68075 Comput. Complexity 28, No. 3, 437-469 (2019). MSC: 68Q15 03D78 68Q09 PDFBibTeX XMLCite \textit{M. Baartse} and \textit{K. Meer}, Comput. Complexity 28, No. 3, 437--469 (2019; Zbl 1429.68075) Full Text: DOI
Muñoz-Velasco, Emilio; Pelegrín, Mercedes; Sala, Pietro; Sciavicco, Guido; Stan, Ionel Eduard On coarser interval temporal logics. (English) Zbl 1480.03010 Artif. Intell. 266, 1-26 (2019). MSC: 03B44 68Q25 03B45 PDFBibTeX XMLCite \textit{E. Muñoz-Velasco} et al., Artif. Intell. 266, 1--26 (2019; Zbl 1480.03010) Full Text: DOI Link
Geffert, Viliam Unary coded PSPACE-complete languages in \(\mathrm{ASPACE}(\log\log n)\). (English) Zbl 1425.68199 Theory Comput. Syst. 63, No. 4, 688-714 (2019). MSC: 68Q45 68Q05 68Q25 PDFBibTeX XMLCite \textit{V. Geffert}, Theory Comput. Syst. 63, No. 4, 688--714 (2019; Zbl 1425.68199) Full Text: DOI
Boiret, Adrien; Hugot, Vincent; Niehren, Joachim; Treinen, Ralf Logics for unordered trees with data constraints. (English) Zbl 1423.68136 J. Comput. Syst. Sci. 104, 149-164 (2019). MSC: 68P15 03B15 03B25 68P05 PDFBibTeX XMLCite \textit{A. Boiret} et al., J. Comput. Syst. Sci. 104, 149--164 (2019; Zbl 1423.68136) Full Text: DOI HAL
Cenciarelli, Pietro; Gorla, Daniele; Salvo, Ivano Depletable channels: dynamics, behaviour, and efficiency in network design. (English) Zbl 1423.68043 Acta Inf. 56, No. 5, 405-431 (2019). MSC: 68M10 05C21 68M12 68R10 PDFBibTeX XMLCite \textit{P. Cenciarelli} et al., Acta Inf. 56, No. 5, 405--431 (2019; Zbl 1423.68043) Full Text: DOI
Rahman, Md Lutfar; Watson, Thomas 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 \textit{M. L. Rahman} and \textit{T. Watson}, LIPIcs -- Leibniz Int. Proc. Inform. 123, Article 9, 12 p. (2018; Zbl 1499.68134) Full Text: DOI
Lück, Martin 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). MSC: 03B45 03D15 68Q17 68Q60 PDFBibTeX XMLCite \textit{M. Lück}, LIPIcs -- Leibniz Int. Proc. Inform. 119, Article 30, 23 p. (2018; Zbl 1515.03101) Full Text: DOI
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Spakowski, Holger; Watanabe, Osamu 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 \textit{E. Hemaspaandra} et al., LIPIcs -- Leibniz Int. Proc. Inform. 117, Article 51, 14 p. (2018; Zbl 1512.68103) Full Text: DOI arXiv
Dose, Titus 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 \textit{T. Dose}, LIPIcs -- Leibniz Int. Proc. Inform. 117, Article 5, 16 p. (2018; Zbl 1510.68023) Full Text: DOI
Beyersdorff, Olaf; Blinkhorn, Joshua; Hinde, Luke 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 \textit{O. Beyersdorff} et al., LIPIcs -- Leibniz Int. Proc. Inform. 94, Article 9, 18 p. (2018; Zbl 1462.68064) Full Text: DOI
Beyersdorff, Olaf; Blinkhorn, Joshua 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 \textit{O. Beyersdorff} and \textit{J. Blinkhorn}, LIPIcs -- Leibniz Int. Proc. Inform. 96, Article 12, 15 p. (2018; Zbl 1487.03066) Full Text: DOI
Kutrib, Martin; Wendlandt, Matthias Expressive capacity of subregular expressions. (English) Zbl 1475.68162 RAIRO, Theor. Inform. Appl. 52, No. 2-4, 201-218 (2018). MSC: 68Q45 PDFBibTeX XMLCite \textit{M. Kutrib} and \textit{M. Wendlandt}, RAIRO, Theor. Inform. Appl. 52, No. 2--4, 201--218 (2018; Zbl 1475.68162) Full Text: DOI
Diller, Martin; Haret, Adrian; Linsbichler, Thomas; Rümmele, Stefan; Woltran, Stefan An extension-based approach to belief revision in abstract argumentation. (English) Zbl 1452.68185 Int. J. Approx. Reasoning 93, 395-423 (2018). MSC: 68T27 03B42 PDFBibTeX XMLCite \textit{M. Diller} et al., Int. J. Approx. Reasoning 93, 395--423 (2018; Zbl 1452.68185) Full Text: DOI
van de Pol, Iris; van Rooij, Iris; Szymanik, Jakub Parameterized complexity of theory of mind reasoning in dynamic epistemic logic. (English) Zbl 1509.03067 J. Logic Lang. Inf. 27, No. 3, 255-294 (2018). MSC: 03B42 68Q27 PDFBibTeX XMLCite \textit{I. van de Pol} et al., J. Logic Lang. Inf. 27, No. 3, 255--294 (2018; Zbl 1509.03067) Full Text: DOI
Faran, Rachel; Kupferman, Orna Spanning the spectrum from safety to liveness. (English) Zbl 1408.68096 Acta Inf. 55, No. 8, 703-732 (2018). MSC: 68Q60 68Q45 PDFBibTeX XMLCite \textit{R. Faran} and \textit{O. Kupferman}, Acta Inf. 55, No. 8, 703--732 (2018; Zbl 1408.68096) Full Text: DOI
Ospichev, S.; Ponomarev, D. On the complexity of formulas in semantic programming. (English) Zbl 1403.03061 Sib. Èlektron. Mat. Izv. 15, 987-995 (2018). MSC: 03D15 68Q15 68Q17 PDFBibTeX XMLCite \textit{S. Ospichev} and \textit{D. Ponomarev}, Sib. Èlektron. Mat. Izv. 15, 987--995 (2018; Zbl 1403.03061)
Gregorio-Rodríguez, Carlos; Llana, Luis; Martínez, Rafael An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation. (English) Zbl 1400.68133 J. Log. Algebr. Methods Program. 100, 152-184 (2018). MSC: 68Q85 68Q55 PDFBibTeX XMLCite \textit{C. Gregorio-Rodríguez} et al., J. Log. Algebr. Methods Program. 100, 152--184 (2018; Zbl 1400.68133) Full Text: DOI
Čermák, Petr; Lomuscio, Alessio; Mogavero, Fabio; Murano, Aniello Practical verification of multi-agent systems against Slk specifications. (English) Zbl 1395.68255 Inf. Comput. 261, Part 3, 588-614 (2018). MSC: 68T27 68Q60 68T42 PDFBibTeX XMLCite \textit{P. Čermák} et al., Inf. Comput. 261, Part 3, 588--614 (2018; Zbl 1395.68255) Full Text: DOI
Hunter, Paul; Pauly, Arno; Pérez, Guillermo A.; Raskin, Jean-François Mean-payoff games with partial observation. (English) Zbl 1393.68105 Theor. Comput. Sci. 735, 82-110 (2018). MSC: 68Q60 91A43 PDFBibTeX XMLCite \textit{P. Hunter} et al., Theor. Comput. Sci. 735, 82--110 (2018; Zbl 1393.68105) Full Text: DOI Link
Lück, Martin Quirky quantifiers: optimal models and complexity of computation tree logic. (English) Zbl 1387.68136 Int. J. Found. Comput. Sci. 29, No. 1, 17-61 (2018). MSC: 68Q25 03B44 PDFBibTeX XMLCite \textit{M. Lück}, Int. J. Found. Comput. Sci. 29, No. 1, 17--61 (2018; Zbl 1387.68136) Full Text: DOI arXiv
Kari, Lila; Konstantinidis, Stavros; Kopecki, Steffen Transducer descriptions of DNA code properties and undecidability of antimorphic problems. (English) Zbl 1390.68402 Inf. Comput. 259, Part 2, 237-258 (2018). MSC: 68Q45 03D05 03D35 PDFBibTeX XMLCite \textit{L. Kari} et al., Inf. Comput. 259, Part 2, 237--258 (2018; Zbl 1390.68402) Full Text: DOI arXiv
Bozzelli, Laura; Sánchez, César Visibly linear temporal logic. (English) Zbl 1425.68182 J. Autom. Reasoning 60, No. 2, 177-220 (2018). MSC: 68Q45 03B44 03D05 PDFBibTeX XMLCite \textit{L. Bozzelli} and \textit{C. Sánchez}, J. Autom. Reasoning 60, No. 2, 177--220 (2018; Zbl 1425.68182) Full Text: DOI
Barth, Dominik; Beck, Moritz; Dose, Titus; Glaßer, Christian; Michler, Larissa; Technau, Marc 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 \textit{D. Barth} et al., LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 33, 14 p. (2017; Zbl 1441.68064) Full Text: DOI
Lu, Ping; Wu, Zhilin; Chen, Haiming 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 \textit{P. Lu} et al., LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 22, 15 p. (2017; Zbl 1441.68126) Full Text: DOI
Haase, Christoph; Kiefer, Stefan; Lohrey, Markus 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 \textit{C. Haase} et al., LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 12, 13 p. (2017; Zbl 1441.68124) Full Text: DOI
Fernau, Henning; Krebs, Andreas Problems on finite automata and the exponential time hypothesis. (English) Zbl 1461.68101 Algorithms (Basel) 10, No. 1, Paper No. 24, 25 p. (2017). MSC: 68Q45 68Q17 68Q25 PDFBibTeX XMLCite \textit{H. Fernau} and \textit{A. Krebs}, Algorithms (Basel) 10, No. 1, Paper No. 24, 25 p. (2017; Zbl 1461.68101) Full Text: DOI
Glaßer, Christian; Jonsson, Peter; Martin, Barnaby Circuit satisfiability and constraint satisfaction around Skolem arithmetic. (English) Zbl 1380.68221 Theor. Comput. Sci. 703, 18-36 (2017). MSC: 68Q25 03F30 PDFBibTeX XMLCite \textit{C. Glaßer} et al., Theor. Comput. Sci. 703, 18--36 (2017; Zbl 1380.68221) Full Text: DOI Link
Yin, Xiang Initial-state detectability of stochastic discrete-event systems with probabilistic sensor failures. (English) Zbl 1370.93173 Automatica 80, 127-134 (2017). MSC: 93C65 93E03 93E10 PDFBibTeX XMLCite \textit{X. Yin}, Automatica 80, 127--134 (2017; Zbl 1370.93173) Full Text: DOI
Geffert, Viliam 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 \textit{V. Geffert}, Lect. Notes Comput. Sci. 10304, 141--153 (2017; Zbl 1423.68252) Full Text: DOI
Krötzsch, Markus; Masopust, Tomáš; Thomazo, Michaël Complexity of universality and related problems for partially ordered NFAs. (English) Zbl 1371.68155 Inf. Comput. 255, Part 1, 177-192 (2017). MSC: 68Q45 68Q17 68Q25 PDFBibTeX XMLCite \textit{M. Krötzsch} et al., Inf. Comput. 255, Part 1, 177--192 (2017; Zbl 1371.68155) Full Text: DOI arXiv
Fernau, Henning; Paramasivan, Meenakshi; Schmid, Markus L.; Vorel, Vojtěch Characterization and complexity results on jumping finite automata. (English) Zbl 1371.68148 Theor. Comput. Sci. 679, 31-52 (2017). MSC: 68Q45 68Q17 PDFBibTeX XMLCite \textit{H. Fernau} et al., Theor. Comput. Sci. 679, 31--52 (2017; Zbl 1371.68148) Full Text: DOI arXiv
Masopust, Tomáš; Thomazo, Michaël On Boolean combinations forming piecewise testable languages. (English) Zbl 1371.68158 Theor. Comput. Sci. 682, 165-179 (2017). MSC: 68Q45 PDFBibTeX XMLCite \textit{T. Masopust} and \textit{M. Thomazo}, Theor. Comput. Sci. 682, 165--179 (2017; Zbl 1371.68158) Full Text: DOI HAL
Boiret, Adrien; Hugot, Vincent; Niehren, Joachim; Treinen, Ralf Automata for unordered trees. (English) Zbl 1362.68128 Inf. Comput. 253, Part 2, 304-335 (2017). MSC: 68Q45 03D05 68Q25 PDFBibTeX XMLCite \textit{A. Boiret} et al., Inf. Comput. 253, Part 2, 304--335 (2017; Zbl 1362.68128) Full Text: DOI HAL
Virtema, Jonni Complexity of validity for propositional dependence logics. (English) Zbl 1362.68114 Inf. Comput. 253, Part 2, 224-236 (2017). MSC: 68Q25 03B45 03B70 68Q17 PDFBibTeX XMLCite \textit{J. Virtema}, Inf. Comput. 253, Part 2, 224--236 (2017; Zbl 1362.68114) Full Text: DOI
Darmann, Andreas; Pferschy, Ulrich; Schauer, Joachim On the shortest path game. (English) Zbl 1351.05152 Discrete Appl. Math. 217, Part 1, 3-18 (2017). MSC: 05C57 05C38 05C12 91A43 91A05 PDFBibTeX XMLCite \textit{A. Darmann} et al., Discrete Appl. Math. 217, Part 1, 3--18 (2017; Zbl 1351.05152) Full Text: DOI
Kari, Lila; Kopecki, Steffen Deciding whether a regular language is generated by a splicing system. (English) Zbl 1353.68167 J. Comput. Syst. Sci. 84, 263-287 (2017). MSC: 68Q45 PDFBibTeX XMLCite \textit{L. Kari} and \textit{S. Kopecki}, J. Comput. Syst. Sci. 84, 263--287 (2017; Zbl 1353.68167) Full Text: DOI
Hannula, Miika; Kontinen, Juha; Lück, Martin; Virtema, Jonni 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 \textit{M. Hannula} et al., Electron. Proc. Theor. Comput. Sci. (EPTCS) 226, 198--212 (2016; Zbl 1478.03066) Full Text: arXiv Link
Bogaerts, Bart; Janhunen, Tomi; Tasharrofi, Shahab Stable-unstable semantics: beyond NP with normal logic programs. (English) Zbl 1379.68044 Theory Pract. Log. Program. 16, No. 5-6, 570-586 (2016). MSC: 68N17 68Q15 68T20 PDFBibTeX XMLCite \textit{B. Bogaerts} et al., Theory Pract. Log. Program. 16, No. 5--6, 570--586 (2016; Zbl 1379.68044) Full Text: DOI arXiv
Kosovskiĭ, N. K.; Kosovskaya, T. M.; Kosovskiĭ, N. N. 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 \textit{N. K. Kosovskiĭ} et al., Vestn. St. Petersbg. Univ., Math. 49, No. 1, 18--22 (2016; Zbl 1420.68094); translation from Vestn. St-Peterbg. Univ., Ser. I, Mat. Mekh. Astron. 3(61), No. 1, 26--31 (2016) Full Text: DOI
Kovásznai, Gergely; Fröhlich, Andreas; Biere, Armin Complexity of fixed-size bit-vector logics. (English) Zbl 1357.68086 Theory Comput. Syst. 59, No. 2, 323-376 (2016). MSC: 68Q25 68Q17 PDFBibTeX XMLCite \textit{G. Kovásznai} et al., Theory Comput. Syst. 59, No. 2, 323--376 (2016; Zbl 1357.68086) Full Text: DOI
Fernau, Henning; Krebs, Andreas 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 \textit{H. Fernau} and \textit{A. Krebs}, Lect. Notes Comput. Sci. 9705, 89--100 (2016; Zbl 1475.68152) Full Text: DOI