Regular Model Checking Upside-Down: An Invariant-Based Approach

Συγγραφείς: Esparza, Javier, Raskin, Mikhail, Welzel, Christoph

Συνεισφορές: Javier Esparza and Mikhail Raskin and Christoph Welzel, Klin, Bartek, Lasota, Sławomir, Muscholl, Anca

Πηγή: Logical Methods in Computer Science, Vol Volume 21, Issue 1 (2025)

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, BC1-199, computer science - distributed, parallel, and cluster computing, Logic, Theory of computation → Problems, reductions and completeness, Theory of computation → Program analysis, QA75.5-76.95, 02 engineering and technology, regular languages, Logic in Computer Science (cs.LO), computer science - logic in computer science, parameterized verification, Computer Science - Distributed, Parallel, and Cluster Computing, regular model-checking, Electronic computers. Computer science, 0202 electrical engineering, electronic engineering, information engineering, Theory of computation → Invariants, structural analysis, Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004, traps

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2205.03060
https://doaj.org/article/e195b9ea7834405e9dd5bd3333c12a61
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.23

Sparsification Lower Bounds for List H -Coloring

Συγγραφείς: Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Paweł Rzążewski

Συνεισφορές: Hubie Chen and Bart M. P. Jansen and Karolina Okrasa and Astrid Pieterse and Paweł Rzążewski, Cao, Yixin, Cheng, Siu-Wing, Li, Minming

Πηγή: 31st International Symposium on Algorithms and Computation (ISAAC 2020)

Θεματικοί όροι: FOS: Computer and information sciences, sparsification, Sparsification, Theory of computation → Problems, reductions and completeness, 0102 computer and information sciences, Computational Complexity (cs.CC), List H-coloring, 01 natural sciences, Computer Science - Computational Complexity, Theory of computation → Graph algorithms analysis, List H-Coloring, Mathematics of computing → Graph coloring, Theory of computation → Parameterized complexity and exact algorithms, ddc:004, Constraint Satisfaction Problem, constraint satisfaction problem

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2009.08353
https://research.tue.nl/en/publications/6cd0cd13-e63b-4cca-9d3b-800c69a29ca0
https://doi.org/10.1145/3612938
https://arxiv.org/abs/2009.08353
https://drops.dagstuhl.de/opus/volltexte/2020/13402/pdf/LIPIcs-ISAAC-2020-58.pdf/
http://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-08353
https://arxiv.org/pdf/2009.08353
https://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-08353
https://drops.dagstuhl.de/opus/volltexte/2020/13402/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.58

Complexity of minimum-size arc-inconsistency explanations

Συγγραφείς: Bessiere, Christian, Carbonnel, Clément, Cooper, Martin C., Hebrard, Emmanuel

Συνεισφορές: Christian Bessiere and Clément Carbonnel and Martin C. Cooper and Emmanuel Hebrard, Gouat, Isabelle, Carbonnel, Clément, Solnon, Christine, Agents, Apprentissage, Contraintes (LIRMM, Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Université de Toulouse (UT), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Argumentation, Décision, Raisonnement, Incertitude et Apprentissage (IRIT-ADRIA), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes (LAAS-ROC), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), ANR-19-P3IA-0004,ANITI,Artificial and Natural Intelligence Toulouse Institute(2019), European Project: 101070149,TUPLES, European Project: 952215,TAILOR(2020)

Πηγή: Constraints. 28:427-449

Θεματικοί όροι: [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], Theory of computation → Problems, reductions and completeness, constraint propagation, Minimum explanations, Complexity, Constraint propagation, minimum explanations, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Theory of computation → Fixed parameter tractability, Theory of computation → Constraint and logic programming, Fixed parameter tractability, Constraint programming, Constraint and logic programming, ddc:004, complexity

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.9
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03833388v1
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03833388v1/document
https://doi.org/10.4230/lipics.cp.2022.9

Linearly Ordered Colourings of Hypergraphs

Συγγραφείς: Nakajima, Tamio-Vesa, Živný, Stanislav

Συνεισφορές: Tamio-Vesa Nakajima and Stanislav Živný, Bojańczyk, Mikołaj, Merelli, Emanuela, Woodruff, David P.

Πηγή: ACM Transactions on Computation Theory. 14:1-19

Θεματικοί όροι: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Theory of computation → Design and analysis of algorithms, Theory of computation → Problems, reductions and completeness, 0102 computer and information sciences, Computational Complexity (cs.CC), promise constraint satisfaction, algebraic approach, 01 natural sciences, PCSP, minions, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Theory of computation → Constraint and logic programming, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, hypegraph colourings, polymorphisms, Computer Science - Discrete Mathematics

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2204.05628
https://ora.ox.ac.uk/objects/uuid:aeb2c090-f064-478a-81c3-bb2ac8df1192
https://doi.org/10.1145/3570909
https://ora.ox.ac.uk/objects/uuid:86b24d89-ef66-45f8-8a80-8f7507eb601d
https://doi.org/10.4230/lipics.icalp.2022.128
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.128

Church synthesis on register automata over linearly ordered data domains

Συγγραφείς: Léo Exibard, Emmanuel Filiot, Ayrat Khalimov

Συνεισφορές: Karolina Okrasa and Paweł Rzążewski, Léo Exibard and Emmanuel Filiot and Ayrat Khalimov, EXIBARD, Léo, Bläser, Markus, Monmege, Benjamin

Πηγή: Leibniz international proceedings in informatics, 187
38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)

Θεματικοί όροι: FOS: Computer and information sciences, Ordered Data Words, Formal Languages and Automata Theory (cs.FL), Register Automata, Transducers, list homomorphism, Computer Science - Formal Languages and Automata Theory, 02 engineering and technology, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Synthesis, fine-grained complexity, Informatique mathématique, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], hereditary graph classes, Theory of computation → Problems, reductions and completeness, Généralités, Computer Science - Computational Complexity, Theory of computation → Graph algorithms analysis, Mathematics of computing → Graph coloring, Church Game, ddc:004

Περιγραφή αρχείου: application/pdf; 1 full-text file(s): application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2004.12141
http://arxiv.org/abs/2010.03393
https://arxiv.org/abs/2004.12141
http://arxiv.org/pdf/2004.12141.pdf
http://ui.adsabs.harvard.edu/abs/2020arXiv200412141E/abstract
https://dblp.uni-trier.de/db/conf/stacs/stacs2021.html#ExibardFK21
https://drops.dagstuhl.de/opus/volltexte/2021/13673/pdf/LIPIcs-STACS-2021-28.pdf/
https://doi.org/10.4230/LIPIcs.STACS.2021.28
https://drops.dagstuhl.de/opus/volltexte/2021/13673/
https://drops.dagstuhl.de/opus/volltexte/2021/13699/pdf/LIPIcs-STACS-2021-54.pdf/
https://drops.dagstuhl.de/opus/volltexte/2021/13699/
https://dblp.uni-trier.de/db/journals/corr/corr2010.html#abs-2010-03393
https://doi.org/10.4230/LIPIcs.STACS.2021.54
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.54
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.28
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/332374
https://hal.science/hal-03409588v1/document
https://doi.org/10.4230/lipics.stacs.2021.54
https://hal.science/hal-03409588v1

QCSP on Reflexive Tournaments

Συγγραφείς: Benoît Larose, Barnaby Martin, Petar Marković, Daniël Paulusma, Siani Smith, Stanislav Živný

Συνεισφορές: Benoît Larose and Petar Marković and Barnaby Martin and Daniël Paulusma and Siani Smith and Stanislav Živný, Mutzel, Petra, Pagh, Rasmus, Herman, Grzegorz

Πηγή: The 29th Annual European Symposium on Algorithms (ESA 2021), Lisbon / Online, 6-8 Sept 2021 [Conference proceedings]
ACM Transactions on Computational Logic, 2022, Vol.23(3), pp.1-22 [Peer Reviewed Journal]
European Symposium on Algorithms
ACM Transaction on Computational Logic

Θεματικοί όροι: FOS: Computer and information sciences, logic, computational complexity, constraint satisfaction, Theory of computation → Problems, reductions and completeness, 0102 computer and information sciences, Constraint satisfaction, Universal algebra, Computational Complexity (cs.CC), 01 natural sciences, Algorithmic graph theory, Computational complexity, Computer Science - Computational Complexity, quantified constraints, universal algebra, ddc:004, 0101 mathematics, algorithmic graph theory, graph theorem, Quantified constraints

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2104.10570
https://dblp.uni-trier.de/db/journals/corr/corr2104.html#abs-2104-10570
https://drops.dagstuhl.de/opus/volltexte/2021/14639/pdf/LIPIcs-ESA-2021-58.pdf/
https://dro.dur.ac.uk/33667/
https://drops.dagstuhl.de/opus/volltexte/2021/14639/
https://arxiv.org/abs/2104.10570
https://ora.ox.ac.uk/objects/uuid:b99ea8d1-d391-4314-b0ec-5090bd33b5ee
https://doi.org/10.1145/3508069
https://ora.ox.ac.uk/objects/uuid:cc71d348-e977-4746-9714-b6cfa88d8f56
https://doi.org/10.4230/lipics.esa.2021.58
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.58
http://dro.dur.ac.uk/33667/
http://dro.dur.ac.uk/33667/1/33667.pdf
https://doi.org/10.4230/LIPIcs.ESA.2021.58
http://dro.dur.ac.uk/34958/1/34958.pdf
https://doi.org/10.1145/3508069
http://dro.dur.ac.uk/34958/

The 2-Attractor Problem Is NP-CompleteLIPIcs, Volume 289, STACS 2024Leibniz International Proceedings in Informatics (LIPIcs)

Συγγραφείς: Fuchs, Janosch, Whittington, Philip

Θεματικοί όροι: computational complexity, Theory of computation → Problems, reductions and completeness, String attractors, Theory of computation → Data compression, dictionary compression, Theory of computation → Approximation algorithms analysis

Computational Complexity of the Weisfeiler-Leman Dimension

Συγγραφείς: Lichter, Moritz, Raßmann, Simon, Schweitzer, Pascal

Συνεισφορές: Moritz Lichter and Simon Raßmann and Pascal Schweitzer

Πηγή: Saarbrücken/Wadern, Germany : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, February, Leibniz International Proceedings in Informatics : LIPIcs 326, 13:1-13:22 (2025). doi:10.4230/LIPIcs.CSL.2025.13
33rd EACSL Annual Conference on Computer Science Logic : CSL 2025, February 10-14, 2025, Amsterdam, Netherlands / edited by Jörg Endrullis, Sylvain Schmitz
33rd EACSL Annual Conference on Computer Science Logic : CSL 2025, February 10-14, 2025, Amsterdam, Netherlands / edited by Jörg Endrullis, Sylvain Schmitz33. EACSL Annual Conference on Computer Science Logic, CSL 2025, Amsterdam, Netherlands, 2025-02-10-2025-02-14

Θεματικοί όροι: FOS: Computer and information sciences, Weisfeiler-Leman algorithm, Discrete Mathematics (cs.DM), Mathematics of computing → Graph algorithms, Theory of computation → Problems, reductions and completeness, coherent configurations, Computational Complexity (cs.CC), Computer Science - Computational Complexity, dimension, ddc:004, Theory of computation → Complexity theory and logic, complexity, Computer Science - Discrete Mathematics

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2402.11531
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2025.13
https://publications.rwth-aachen.de/record/1003905

The Complexity of Promise SAT on Non-Boolean Domains

Συγγραφείς: Brandts, Alex, Wrochna, Marcin, Živný, Stanislav

Συνεισφορές: Alex Brandts and Marcin Wrochna and Stanislav Živný, Artur Czumaj, Anuj Dawar, Emanuela Merelli

Πηγή: ACM Transactions on Computation Theory
47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)

Θεματικοί όροι: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), G.2.1, F.2.2, Theory of computation → Problems, reductions and completeness, 0102 computer and information sciences, Computational Complexity (cs.CC), promise constraint satisfaction, algebraic approach, 16. Peace & justice, 01 natural sciences, PCSP, label cover, Computer Science - Computational Complexity, Theory of computation → Constraint and logic programming, 68R05, 68Q17, ddc:004, polymorphisms, Computer Science - Discrete Mathematics

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/pdf/1911.09065
http://arxiv.org/abs/1911.09065
https://drops.dagstuhl.de/opus/volltexte/2020/12424/pdf/LIPIcs-ICALP-2020-17.pdf/
https://dblp.uni-trier.de/db/conf/icalp/icalp2020.html#BrandtsWZ20
https://doi.org/10.4230/LIPIcs.ICALP.2020.17
https://drops.dagstuhl.de/opus/volltexte/2020/12424/
https://arxiv.org/abs/1911.09065
https://dblp.uni-trier.de/db/journals/corr/corr1911.html#abs-1911-09065
https://doi.org/10.1145/3470867
http://arxiv.org/pdf/1911.09065.pdf
http://ui.adsabs.harvard.edu/abs/2019arXiv191109065B/abstract
https://dl.acm.org/doi/10.1145/3470867
https://arxiv.org/pdf/1911.09065v3
https://arxiv.org/abs/1911.09065
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.17

The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains

Συγγραφείς: Viola, Caterina, Živný, Stanislav

Συνεισφορές: Caterina Viola and Stanislav Živný, Javier Esparza, Daniel Kráľ

Πηγή: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
ACM Transactions on Algorithms

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Discrete Mathematics (cs.DM), Valued constraint satisfaction, Theory of computation → Problems, reductions and completeness, valued constraint satisfaction, 0102 computer and information sciences, Computational Complexity (cs.CC), promise constraint satisfaction, 16. Peace & justice, 01 natural sciences, Logic in Computer Science (cs.LO), Computer Science - Computational Complexity, Promise constraint satisfaction, Convex relaxations, Computer Science - Data Structures and Algorithms, Theory of computation → Constraint and logic programming, Data Structures and Algorithms (cs.DS), ddc:004, convex relaxations, 0101 mathematics, Polymorphisms, polymorphisms, Computer Science - Discrete Mathematics

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/opus/volltexte/2020/12756/pdf/LIPIcs-MFCS-2020-85.pdf
http://arxiv.org/abs/2007.01779
http://ui.adsabs.harvard.edu/abs/2020arXiv200701779V/abstract
https://arxiv.org/pdf/2007.01779.pdf
https://arxiv.org/abs/2007.01779
https://dl.acm.org/doi/10.1145/3458041
https://dblp.uni-trier.de/db/journals/corr/corr2007.html#abs-2007-01779
https://ora.ox.ac.uk/objects/uuid:6bab5669-9398-485d-877c-5bcff547c546
https://doi.org/10.1145/3458041
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.85
https://hdl.handle.net/20.500.11769/605674
https://doi.org/10.4230/LIPIcs.MFCS.2020.85

Decomposing Permutation Automata

Συγγραφείς: Jecker, Ismaël, Mazzocchi, Nicolas, Wolf, Petra

Συνεισφορές: Ismaël Jecker and Nicolas Mazzocchi and Petra Wolf, Haddad, Serge, Varacca, Daniele

Πηγή: 32nd International Conference on Concurrency Theory

Θεματικοί όροι: Primality, FOS: Computer and information sciences, Decomposition, Commutative languages, Formal Languages and Automata Theory (cs.FL), Deterministic finite automata (DFA), Theory of computation → Problems, reductions and completeness, Computer Science - Formal Languages and Automata Theory, Theory of computation → Regular languages, 01 natural sciences, Permutation automata, F.4.3, Regular Languages, ddc:004, 0101 mathematics

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2107.04683
https://drops.dagstuhl.de/opus/volltexte/2021/14395/pdf/LIPIcs-CONCUR-2021-18.pdf/
https://dblp.uni-trier.de/db/journals/corr/corr2107.html#abs-2107-04683
https://arxiv.org/abs/2107.04683
https://drops.dagstuhl.de/opus/volltexte/2021/14395/
https://doi.org/10.4230/LIPIcs.CONCUR.2021.18
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.18

The 2-Attractor Problem Is NP-Complete

Συγγραφείς: Fuchs, Janosch, Whittington, Philip

Συνεισφορές: Janosch Fuchs and Philip Whittington

Πηγή: Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 289, 35, [1]-13 (2024). doi:10.4230/LIPICS.STACS.2024.35
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov41. International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, 2024-03-11-2024-03-14

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Computational Complexity, computational complexity, Theory of computation → Problems, reductions and completeness, ddc:004, Computational Complexity (cs.CC), Theory of computation → Data compression, String attractors, dictionary compression, Theory of computation → Approximation algorithms analysis

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2304.06523
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.35
https://publications.rwth-aachen.de/record/994994

Parameterized Complexities of Dominating and Independent Set Reconfiguration

Συγγραφείς: Bodlaender, Hans L., Groenland, Carla, Swennenhuis, Céline M. F.

Συνεισφορές: Hans L. Bodlaender and Carla Groenland and Céline M. F. Swennenhuis, Sub Algorithms and Complexity, Algorithms and Complexity, Golovach, Petr A., Zehavi, Meirav

Θεματικοί όροι: FOS: Computer and information sciences, Theory of computation → Problems, reductions and completeness, Dominating set reconfiguration, XNL, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, dominating set reconfiguration, Parameterized complexity, Computer Science - Computational Complexity, independent set reconfiguration, 0202 electrical engineering, electronic engineering, information engineering, Theory of computation → Parameterized complexity and exact algorithms, XL, XNLP, ddc:004, Independent set reconfiguration, W-hierarchy, 68Q27, 68Q25, Software

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2106.15907
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.9
https://dspace.library.uu.nl/handle/1874/416476

PPP-Completeness and Extremal Combinatorics

Συγγραφείς: Bourneuf, Romain, Folwarczný, Lukáš, Hubáček, Pavel, Rosen, Alon, Schwartzbach, Nikolaj I.

Συνεισφορές: Romain Bourneuf and Lukáš Folwarczný and Pavel Hubáček and Alon Rosen and Nikolaj I. Schwartzbach, Kalai, Yael Tauman, Tauman Kalai, Yael

Πηγή: Bourneuf, R, Folwarczný, L, Hubáček, P, Rosen, A & Schwartzbach, N I 2023, PPP-Completeness and Extremal Combinatorics. in Y T Kalai (ed.), 14th Innovations in Theoretical Computer Science Conference (ITCS 2023)., 22, Dagstuhl Publishing, Wadern, Leibniz International Proceedings in Informatics, pp. 1-20. https://doi.org/10.4230/LIPIcs.ITCS.2023.22

Θεματικοί όροι: FOS: Computer and information sciences, Theory of computation → Problems, reductions and completeness, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, total search problems, FOS: Mathematics, Mathematics - Combinatorics, TOTAL SEARCH PROBLEMS, EXTREMAL COMBINATORICS, PPP-COMPLETENESS, extremal combinatorics, PPP-completeness, Combinatorics (math.CO), ddc:004, 0101 mathematics, Theory of computation → Complexity classes

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2209.04827
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.22
https://hdl.handle.net/11565/4062718
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.22
https://doi.org/10.4230/lipics.itcs.2023.22
https://arxiv.org/abs/2209.04827
https://pure.au.dk/portal/en/publications/651af6c8-ad8b-4316-aad0-240727978113
https://doi.org/10.4230/LIPIcs.ITCS.2023.22

A Structural Investigation of the Approximability of Polynomial-Time Problems

Συγγραφείς: Bringmann, Karl, Cassis, Alejandro, Fischer, Nick, Künnemann, Marvin

Συνεισφορές: Karl Bringmann and Alejandro Cassis and Nick Fischer and Marvin Künnemann, Bojańczyk, Mikołaj, Merelli, Emanuela, Woodruff, David P.

Πηγή: 49th EATCS International Conference on Automata, Languages, and Programming
Leibniz International Proceedings in Informatics

Θεματικοί όροι: FOS: Computer and information sciences, Hardness of Approximation in P, Fine-grained Complexity Theory, Theory of computation → Problems, reductions and completeness, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Theory of computation → Approximation algorithms analysis, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Classification Theorems, Data Structures and Algorithms (cs.DS), ddc:004

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2204.11681
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.30
http://hdl.handle.net/21.11116/0000-000B-15B5-1
http://hdl.handle.net/21.11116/0000-000B-15B7-F

Complexity of Coverability in Depth-Bounded Processes

Συγγραφείς: Balasubramanian, A. R.

Συνεισφορές: A. R. Balasubramanian, Klin, Bartek, Lasota, Sławomir, Muscholl, Anca

Πηγή: 33rd International Conference on Concurrency Theory, CONCUR 2022

Θεματικοί όροι: π-calculus, Depth-bounded processes, Theory of computation → Distributed computing models, Theory of computation → Problems, reductions and completeness, ddc:004, Fast-growing complexity classes

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.17

Fine-grained completeness for optimization in P

Συγγραφείς: Bringmann, Karl, Cassis, Alejandro, Fischer, Nick, Künnemann, Marvin, Wootters, Mary, Sanità, Laura

Συνεισφορές: Karl Bringmann and Alejandro Cassis and Nick Fischer and Marvin Künnemann, Wootters, Mary, Sanità, Laura

Πηγή: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Leibniz International Proceedings in Informatics
Leibniz International Proceedings in Informatics (LIPIcs), 207
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021

Θεματικοί όροι: ddc:004, FOS: Computer and information sciences, Completeness, Fine-grained Complexity & Algorithm Design, Hardness of approximation in P, 0102 computer and information sciences, Computational Complexity (cs.CC), 7. Clean energy, 01 natural sciences, 12. Responsible consumption, Dimensionality reductions, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0101 mathematics, Dimensionality Reductions, Hardness of Approximation in P, 4. Education, DATA processing & computer science, Theory of computation → Problems, reductions and completeness, 16. Peace & justice, Computer Science - Computational Complexity, Fine-grained complexity & algorithm design

Περιγραφή αρχείου: application/pdf; application/application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2107.01721
https://dblp.uni-trier.de/db/journals/corr/corr2107.html#abs-2107-01721
https://drops.dagstuhl.de/opus/volltexte/2021/14702/pdf/LIPIcs-APPROX9.pdf/
https://arxiv.org/pdf/2107.01721
https://drops.dagstuhl.de/opus/volltexte/2021/14702/
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_3331360
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.9
http://hdl.handle.net/21.11116/0000-0009-B411-8
http://hdl.handle.net/21.11116/0000-0009-B413-6
http://hdl.handle.net/21.11116/0000-0008-E26A-2
http://hdl.handle.net/21.11116/0000-0008-E26C-0
https://publikationen.bibliothek.kit.edu/1000175568
https://publikationen.bibliothek.kit.edu/1000175568/155261145
https://doi.org/10.5445/IR/1000175568
http://hdl.handle.net/20.500.11850/507986

Algorithms and Complexity on Indexing Elastic Founder Graphs

Συγγραφείς: Equi, Massimo, Norri, Tuukka, Alanko, Jarno, Cazaux, Bastien, Tomescu, Alexandru I., Mäkinen, Veli

Συνεισφορές: Ahn, Hee-Kap, Sadakane, Kunihiko, Department of Computer Science, Algorithmic Bioinformatics, Genome-scale Algorithmics research group / Veli Mäkinen, Bioinformatics, Helsinki Institute for Information Technology, Massimo Equi and Tuukka Norri and Jarno Alanko and Bastien Cazaux and Alexandru I. Tomescu and Veli Mäkinen

Θεματικοί όροι: Applied computing → Genomics, Theory of computation → Graph algorithms analysis, Computer and information sciences, Theory of computation → Sorting and searching, segmentation, Theory of computation → Problems, reductions and completeness, Theory of computation → Dynamic programming, multiple sequence alignment, orthogonal vectors hypothesis, Theory of computation → Pattern matching, ddc:004

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://hdl.handle.net/10138/338450
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.20

On the Hardness of Compressing Weights

Συγγραφείς: Jansen, Bart M. P., Roy, Shivesh K., Włodarczyk, Michał

Συνεισφορές: Bart M. P. Jansen and Shivesh K. Roy and Michał Włodarczyk, Bonchi, Filippo, Puglisi, Simon J.

Πηγή: Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021

Θεματικοί όροι: FOS: Computer and information sciences, Constraint satisfaction problems, Theory of computation → Problems, reductions and completeness, Compression, 0102 computer and information sciences, Computational Complexity (cs.CC), compression, 7. Clean energy, 01 natural sciences, Computer Science - Computational Complexity, kernelization, Computer Science - Data Structures and Algorithms, edge-weighted clique, Theory of computation → Parameterized complexity and exact algorithms, Kernelization, Data Structures and Algorithms (cs.DS), Edge-weighted clique, ddc:004, constraint satisfaction problems

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2107.02554
https://research.tue.nl/en/publications/18ce02c9-97f6-443c-bd1c-a91ab4521e0c
https://doi.org/10.4230/LIPIcs.MFCS.2021.64
https://arxiv.org/pdf/2107.02554
https://drops.dagstuhl.de/opus/volltexte/2021/14504/pdf/LIPIcs-MFCS-2021-64.pdf/
https://drops.dagstuhl.de/opus/volltexte/2021/14504/
https://dblp.uni-trier.de/db/journals/corr/corr2107.html#abs-2107-02554
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.64

Complexity of Coverability in Bounded Path Broadcast Networks

Συγγραφείς: Balasubramanian, A. R.

Συνεισφορές: A. R. Balasubramanian, Bojańczyk, Mikołaj, Chekuri, Chandra

Πηγή: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021

Θεματικοί όροι: Bounded path networks, Theory of computation → Distributed computing models, Parameterized verification, Theory of computation → Problems, reductions and completeness, ddc:004, Fast-growing complexity classes

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2021.35