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

Complexity theory of orbit closure intersection for tensors: reductions, completeness, and graph isomorphism hardness

Συγγραφείς: Lysikov, Vladimir, Walter, Michael

Πηγή: 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2025 IEEE 66th Annual Symposium on. :486-511 Dec, 2025

Relation: 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)

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

Computational Complexity of Sum-of-Squares Bounds for Copositive Programs

Συγγραφείς: Marilena Palomba, Lucas Slot, Luis Felipe Vargas, Monaldo Mastrolilli

Πηγή: SIAM Journal on Optimization. 35:2684-2711

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Computational Complexity, 90C22, 90C23, 90C25, 90C27, 90C51, 90C60, Optimization and Control (math.OC), FOS: Mathematics, Computational Complexity (cs.CC), Mathematics - Optimization and Control

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

Computational Complexity of Statistics: New Insights from Low-Degree Polynomials

Συγγραφείς: Wein, Alexander S.

Θεματικοί όροι: Mathematics - Statistics Theory, Computer Science - Computational Complexity, Statistics - Machine Learning

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

Meta-Mathematics of Computational Complexity Theory

Συγγραφείς: Oliveira, Igor C.

Θεματικοί όροι: Computer Science - Computational Complexity, Computer Science - Logic in Computer Science, Mathematics - Logic

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

The Computational Complexity of Positive Non-Clashing Teaching in Graphs

Συγγραφείς: Ganian, Robert, Khazaliya, Liana, Inerney, Fionn Mc, Rocton, Mathis

Θεματικοί όροι: Computer Science - Computational Complexity, Computer Science - Discrete Mathematics, Computer Science - Data Structures and Algorithms, Computer Science - Machine Learning, Statistics - Machine Learning

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

Computational Complexity of UAP Reverse Engineering: A Formal Analysis of Automaton Identification and Data Complexity

Συγγραφείς: Daghbouche, Karim

Πηγή: J.Acad. (N.Y.) 2025, Vol. 14, 1:3-15

Θεματικοί όροι: Computer Science - Computational Complexity

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

On Computational Limits and Provably Efficient Criteria of Visual Autoregressive Models: A Fine-Grained Complexity Analysis

Συγγραφείς: Ke, Yekun, Li, Xiaoyu, Liang, Yingyu, Sha, Zhizhou, Shi, Zhenmei, Song, Zhao

Θεματικοί όροι: Computer Science - Machine Learning, Computer Science - Artificial Intelligence, Computer Science - Computational Complexity, Computer Science - Computer Vision and Pattern Recognition

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

On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective

Συγγραφείς: Li, Xiaoyu, Liang, Yingyu, Shi, Zhenmei, Song, Zhao, Wang, Wei, Zhang, Jiahao

Θεματικοί όροι: Computer Science - Machine Learning, Computer Science - Artificial Intelligence, Computer Science - Computational Complexity

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

Linear Equations with Min and Max Operators: Computational Complexity

Συγγραφείς: Chatterjee, Krishnendu, Luo, Ruichen, Saona, Raimundo, Svoboda, Jakub

Θεματικοί όροι: Computer Science - Computational Complexity, Computer Science - Artificial Intelligence, Mathematics - Optimization and Control

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

The Computational Limits of State-Space Models and Mamba via the Lens of Circuit Complexity

Συγγραφείς: Chen, Yifang, Li, Xiaoyu, Liang, Yingyu, Shi, Zhenmei, Song, Zhao

Θεματικοί όροι: Computer Science - Computational Complexity, Computer Science - Artificial Intelligence, Computer Science - Computation and Language, Computer Science - Machine Learning

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

Linear Equations with Min and Max Operators: Computational Complexity

Συγγραφείς: Krishnendu Chatterjee, Ruichen Luo, Raimundo Saona, Jakub Svoboda

Πηγή: Proceedings of the AAAI Conference on Artificial Intelligence. 39:11150-11157

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Computational Complexity, Artificial Intelligence (cs.AI), Computer Science - Artificial Intelligence, Optimization and Control (math.OC), FOS: Mathematics, Computational Complexity (cs.CC), Mathematics - Optimization and Control

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

The Information-Computation Gap: Computational Complexity of Belief Updating Predicts Quality of Human Beliefs

Συγγραφείς: Xu, Zhongyu Andy, Murawski, Carsten, Garagnani, Michele, Suzuki, Shinsuke

Πηγή: Proceedings of the Annual Meeting of the Cognitive Science Society. 48

Θεματικοί όροι: Computer Science, Psychology, Decision making, Reasoning, Bayesian modeling

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

Σύνδεσμος πρόσβασης: https://escholarship.org/uc/item/9s99v0vk
https://escholarship.org/content/qt9s99v0vk/qt9s99v0vk.pdf

Computational Complexity and Integer Programming Formulation of the Oredango Puzzle

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

Θεματικοί όροι: Computer Science - Computational Complexity

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

On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization

Συγγραφείς: Figueira, José Rui, Klamroth, Kathrin, Stiglmayr, Michael, Santos, Julia Sudhoff

Θεματικοί όροι: Computer Science - Discrete Mathematics, Computer Science - Computational Complexity, Mathematics - Optimization and Control

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

The Computational Complexity of Circuit Discovery for Inner Interpretability

Συγγραφείς: Adolfi, Federico, Vilas, Martina G., Wareham, Todd

Θεματικοί όροι: Computer Science - Artificial Intelligence, Computer Science - Computational Complexity, Quantitative Biology - Neurons and Cognition

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

Computational Complexity of Game Boy Games

Συγγραφείς: Tirmazi, Hayder, Tirmazi, Ali, Tran, Tien Phuoc

Θεματικοί όροι: Computer Science - Computational Complexity

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

More efficient sifting for grid norms, and applications to multiparty communication complexity

Συγγραφείς: Zander Kelley, Xin Lyu

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

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

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

Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings)

Συγγραφείς: Wulf, Lasse

Πηγή: 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2025 IEEE 66th Annual Symposium on. :531-551 Dec, 2025

Relation: 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)