On the hull and interval numbers of oriented graphs

Συγγραφείς: Júlio Araújo 0001, Ana Karolinna Maia, Pedro Paulo de Medeiros, Lucia Draque Penso

Πηγή: Discrete Applied Mathematics. 387:76-91

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Computational Complexity, Discrete Mathematics (cs.DM), FOS: Mathematics, Mathematics - Combinatorics, 0102 computer and information sciences, Combinatorics (math.CO), G.2.2, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Discrete Mathematics

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2210.01598

XALP-completeness of parameterized problems on planar graphs

Συγγραφείς: Hans L. Bodlaender, Krisztina Szilágyi

Πηγή: Discrete Applied Mathematics. 386:156-174

Θεματικοί όροι: FOS: Computer and information sciences, Parameterized complexity, Computer Science - Computational Complexity, Outerplanarity, XNLP, Planar graphs, G.2.2, Computational Complexity (cs.CC), XALP, 05C10, 68Q15

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2402.03087

Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs

Συγγραφείς: Marek Filakovský, Tamio-Vesa Nakajima, Jakub Opršal, Gianluca Tasinato, Uli Wagner

Συνεισφορές: Marek Filakovský and Tamio-Vesa Nakajima and Jakub Opršal and Gianluca Tasinato and Uli Wagner

Πηγή: 41ST INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, STACS 2024

Θεματικοί όροι: FOS: Computer and information sciences, topological methods, Computational Complexity (cs.CC), Computer Science - Computational Complexity, promise problem, FOS: Mathematics, Mathematics - Combinatorics, Algebraic Topology (math.AT), Mathematics - Algebraic Topology, Combinatorics (math.CO), hypergraph colouring, constraint satisfaction problem

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2312.12981
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.34

Hardness of Learning Boolean Functions from Label Proportions

Συγγραφείς: Venkatesan Guruswami, Rishi Saket

Συνεισφορές: Venkatesan Guruswami and Rishi Saket

Πηγή: ACM Transactions on Computation Theory. 18:1-15

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Machine Learning, Hardness, Computational learning, Computer Science - Data Structures and Algorithms, Learning from label proportions, Data Structures and Algorithms (cs.DS), Boolean functions, Computational Complexity (cs.CC), Machine Learning (cs.LG)

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2403.19401
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2023.37

Computational Complexity of the Weisfeiler-Leman Dimension

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

Συνεισφορές: 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, Computer Science - Computational Complexity, Discrete Mathematics (cs.DM), dimension, Mathematics of computing → Graph algorithms, Theory of computation → Problems, reductions and completeness, coherent configurations, Computational Complexity (cs.CC), 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

Exact Algorithms for Distance to Unique Vertex Cover

Συγγραφείς: Foivos Fioravantes, Dusan Knop, Nikolaos Melissinos, Michal Opler, Manolis Vasilakis

Πηγή: Proceedings of the AAAI Conference on Artificial Intelligence. 40:14217-14224

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Computational Complexity (cs.CC)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2502.05059

Enumerating minimal defensive alliances

Συγγραφείς: Zhidan Feng 0002, Henning Fernau, Kevin Mann

Πηγή: Discrete Applied Mathematics. 384:309-325

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Computational Complexity, Discrete Mathematics (cs.DM), 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 16. Peace & justice, 01 natural sciences, Computer Science - Discrete Mathematics

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2312.11963

Globally minimal defensive alliances: A parameterized perspective

Συγγραφείς: Ajinkya Gaikwad, Soumen Maity

Πηγή: Discrete Applied Mathematics. 385:86-99

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2202.02010
https://arxiv.org/abs/2202.02010

Reducing Isotropy and Volume to KLS: Faster Rounding and Volume Algorithms

Συγγραφείς: He Jia, Aditi Laddha, Yin Tat Lee, Santosh Vempala

Πηγή: Journal of the ACM. 73:1-21

Θεματικοί όροι: Mathematics - Functional Analysis, FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 0101 mathematics, Computational Complexity (cs.CC), 01 natural sciences, Functional Analysis (math.FA)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2008.02146

Bisection width, discrepancy, and eigenvalues of hypergraphs

Συγγραφείς: Räty, Eero, Tomon, István

Πηγή: Journal of Combinatorial Theory, Series B. 177:186-215

Θεματικοί όροι: FOS: Computer and information sciences, Discrete Mathematics, Computer Sciences, Bisection width, Eigenvalue, Computational Complexity (cs.CC), Diskret matematik, Computer Science - Computational Complexity, Datavetenskap (datalogi), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Discrepancy, Alon-Boppana theorem

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2409.15140
http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-246881

Computational Complexity and Integer Programming Formulation of the Oredango Puzzle

Συγγραφείς: Takuma Takahata, Norito Minamikawa, Takayuki Okuno

Πηγή: IEICE Transactions on Information and Systems. :391-398

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computational Complexity (cs.CC)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2503.10393

Property Testing with Online Adversaries

Συγγραφείς: Omri Ben-Eliezer, Esty Kelman, Uri Meir, Sofya Raskhodnikova

Συνεισφορές: Omri Ben-Eliezer and Esty Kelman and Uri Meir and Sofya Raskhodnikova

Πηγή: ACM Transactions on Computation Theory

Θεματικοί όροι: FOS: Computer and information sciences, Reed-Muller codes, Discrete Mathematics (cs.DM), Computational Complexity (cs.CC), corruption-resilience, erasure-resilience, Computer Science - Computational Complexity, Linearity testing, low-degree testing, testing properties of sequences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Computer Science - Discrete Mathematics

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2311.16566
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.11

SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube Optimization

Συγγραφείς: Adam Kurpisz, Aaron Potechin, Elias Wirth

Συνεισφορές: Adam Kurpisz and Aaron Potechin and Elias Samuel Wirth, Bansal, Nikhil, Merelli, Emanuela, Worrell, James

Πηγή: Leibniz International Proceedings in Informatics (LIPIcs), 198
48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)

Θεματικοί όροι: FOS: Computer and information sciences, Semidefinite Programming, symmetric quadratic functions, 0211 other engineering and technologies, SoS certificate, Symmetric quadratic functions, 0102 computer and information sciences, 02 engineering and technology, Hypercube optimization, semidefinite programming, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, hypercube optimization, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2107.04100
https://arxiv.org/abs/2107.04100
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.90
http://hdl.handle.net/20.500.11850/507054

Counting of Teams in First-Order Team Logics

Συγγραφείς: Anselm Haak, Juha Kontinen, Fabian Müller, Heribert Vollmer, Fan Yang

Συνεισφορές: Rossmanith, Peter, Heggernes, Pinar, Katoen, Joost-Pieter, Department of Mathematics and Statistics, Anselm Haak and Juha Kontinen and Fabian Müller and Heribert Vollmer and Fan Yang

Πηγή: ACM Transactions on Computational Logic. 27:1-22

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, cs.CC, team-based logics, Team-based logics, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, cs.LO, Descriptive complexity, Logic in Computer Science (cs.LO), descriptive complexity, Computer Science - Computational Complexity, finite model theory, counting classes, Counting classes, 0101 mathematics, Mathematics

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/1902.00246
https://research-portal.uu.nl/en/publications/b5fa3dae-4a00-4303-8b12-c1b699a046e2
https://doi.org/10.1145/3771721
http://hdl.handle.net/10138/307137
http://hdl.handle.net/10138/625788
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.19

Incompressibility and Spectral Gaps of Random Circuits

Συγγραφείς: Chi-Fang Chen, Jeongwan Haah, Jonas Haferkamp, Yunchao Liu 0002, Tony Metger, Xinyu Tan

Πηγή: 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS). :1304-1312

Θεματικοί όροι: FOS: Computer and information sciences, Quantum Physics, Computer Science - Computational Complexity, FOS: Physical sciences, Computational Complexity (cs.CC), Quantum Physics (quant-ph)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2406.07478

Collapsing Catalytic Classes

Συγγραφείς: Michal Koucký 0001, Ian Mertz, Edward Pyne, Sasha Sami

Πηγή: 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS). :455-463

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computational Complexity (cs.CC)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2504.08444
https://eccc.weizmann.ac.il/report/2025/019

The Quasi-Polynomial Low-Degree Conjecture is False

Συγγραφείς: Rares-Darius Buhai, Jun-Ting Hsieh, Aayush Jain, Pravesh K. Kothari

Πηγή: 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS). :2577-2590

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Computational Complexity (cs.CC)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2505.17360

Improved Lower Bounds for all Odd-Query Locally Decodable Codes

Συγγραφείς: Arpon Basu, Jun-Ting Hsieh, Pravesh K. Kothari, Andrew D. Lin

Πηγή: 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS). :1262-1285

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Computational Complexity, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Computational Complexity (cs.CC)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2411.14361
https://eccc.weizmann.ac.il/report/2024/189

Bipartite Matching is in Catalytic Logspace

Συγγραφείς: Aryan Agarwala, Ian Mertz

Πηγή: FOCS 2025

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Computational Complexity (cs.CC)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2504.09991
https://eccc.weizmann.ac.il/report/2025/048
https://hdl.handle.net/21.11116/0000-0012-F806-E

Theoretical limitations of multi-layer Transformer

Συγγραφείς: Lijie Chen 0001, Binghui Peng, Hongxun Wu

Πηγή: 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS). :2631-2653

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Machine Learning, Computer Science - Computational Complexity, Artificial Intelligence (cs.AI), Computer Science - Artificial Intelligence, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Computational Complexity (cs.CC), Machine Learning (cs.LG)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2412.02975