The next gap in the subrank of 3-tensors

Συγγραφείς: Fulvio Gesmundo, Jeroen Zuiddam

Πηγή: Linear Algebra and its Applications. 722:1-11

Θεματικοί όροι: FOS: Computer and information sciences, Mathematics - Algebraic Geometry, Computer Science - Computational Complexity, Quantum Physics, 5A69, 4N07, 15A72, 68R05, FOS: Mathematics, Mathematics - Combinatorics, FOS: Physical sciences, Combinatorics (math.CO), Computational Complexity (cs.CC), Quantum Physics (quant-ph), Algebraic Geometry (math.AG)

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

Positive moments forever: Undecidable and decidable cases

Συγγραφείς: Gemma De les Coves, Joshua Graf, Andreas Klingler, Tim Netzer

Πηγή: Linear Algebra and its Applications. 722:255-275

Θεματικοί όροι: FOS: Computer and information sciences, Mathematics - Algebraic Geometry, Computer Science - Computational Complexity, Quantum Physics, FOS: Mathematics, FOS: Physical sciences, Computational Complexity (cs.CC), 13P99 (Primary), 11B37 (Secondary), Quantum Physics (quant-ph), Algebraic Geometry (math.AG)

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

Parameterized Max Min Feedback Vertex Set

Συγγραφείς: Michael Lampis, Nikolaos Melissinos, Manolis Vasilakis

Συνεισφορές: Michael Lampis and Nikolaos Melissinos and Manolis Vasilakis

Πηγή: SIAM Journal on Discrete Mathematics. 39:1587-1620

Θεματικοί όροι: FOS: Computer and information sciences, Parameterized algorithms, Computer Science - Computational Complexity, ETH, Treewidth, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, ddc:004, Computational Complexity (cs.CC), Feedback vertex set, 01 natural sciences

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

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

On the tractability of defensive alliance problem

Συγγραφείς: Sangam Balchandar Reddy, Anjeneya Swami Kare

Πηγή: Discrete Applied Mathematics. 380:116-127

Θεματικοί όροι: 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/2307.09760

Hardness transitions of star colouring and restricted star colouring

Συγγραφείς: Shalu M.A., Cyriac Antony

Πηγή: Discrete Applied Mathematics. 380:1-33

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

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

About the infinite windy firebreak location problem

Συγγραφείς: Marc Demange, Alessia Di Fonso, Gabriele Di Stefano, Pierpaolo Vittorini

Πηγή: Discrete Applied Mathematics. 378:280-293

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Computational Complexity, Discrete Mathematics (cs.DM), G.2.2, 0102 computer and information sciences, G.2.3, F.2.2, 15. Life on land, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Discrete Mathematics, 90B80, 68Q25, 90C27, 05C63

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

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

Minimality and computability of languages of G-shifts

Συγγραφείς: Amir, Djamel Eddine, de Menibus, Benjamin Hellouin

Θεματικοί όροι: Computer Science - Formal Languages and Automata Theory, Computer Science - Computational Complexity, Computer Science - Discrete Mathematics, Mathematics - Dynamical Systems, 37B51 37B05 68Q17, F.1.3, G.2

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

Complexity of Contextuality

Συγγραφείς: Yianni, Theodoros, Shahandeh, Farid

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

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

POLARON: Precision-aware On-device Learning and Adaptive Runtime-cONfigurable AI acceleration

Συγγραφείς: Lokhande, Mukul, Vishvakarma, Santosh Kumar

Θεματικοί όροι: Computer Science - Hardware Architecture, Computer Science - Artificial Intelligence, Computer Science - Computational Complexity, Electrical Engineering and Systems Science - Image and Video Processing

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

What makes an Ensemble (Un) Interpretable?

Συγγραφείς: Bassan, Shahaf, Amir, Guy, Zehavi, Meirav, Katz, Guy

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

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

Refuting Perfect Matchings in Spectral Expanders is Hard

Συγγραφείς: Biswas, Ari, Nenadov, Rajko

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

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

Quantum SAT Problems with Finite Sets of Projectors are Complete for a Plethora of Classes

Συγγραφείς: Cardoso, Ricardo Rivera, Meiburg, Alex, Nagaj, Daniel

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

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

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?

Συγγραφείς: Bannach, Max, Demaine, Erik D., Gomez, Timothy, Hecher, Markus

Θεματικοί όροι: Computer Science - Computational Complexity, Computer Science - Discrete Mathematics, Computer Science - Data Structures and Algorithms, Computer Science - Logic in Computer Science, Mathematics - Combinatorics, 68Q17, 68Q15, 68Q25, 68Q27, 03B05, 03D10, 03D15, 05C85, 05C62, 05-08, 94C15, G.2.1, G.2.2, F.4.1, F.1.3, F.1.1

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

Robust predicate and function computation in continuous chemical reaction networks

Συγγραφείς: Calabrese, Kim, Doty, David, Latifi, Mina

Θεματικοί όροι: Computer Science - Computational Complexity, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Emerging Technologies

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

An Optimized Franz-Parisi Criterion and its Equivalence with SQ Lower Bounds

Συγγραφείς: Chen, Siyu, Misiakiewicz, Theodor, Zadik, Ilias, Zhang, Peiyuan

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

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

An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem

Συγγραφείς: Yang, Yang

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

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

Equilibrium Computation in First-Price Auctions with Correlated Priors

Συγγραφείς: Filos-Ratsikas, Aris, Giannakopoulos, Yiannis, Hollender, Alexandros, Kokkalis, Charalampos

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

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

Sorting by pile shuffles on queue-like and stack-like piles can be hard

Συγγραφείς: Treleaven, Kyle B.

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

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

Identity Testing for Circuits with Exponentiation Gates

Συγγραφείς: Li, Jiatu, Wu, Mengdi

Θεματικοί όροι: Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, F.2.2

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