Search Results - "Computer Science - Computational Complexity"

The next gap in the subrank of 3-tensors

Authors: Fulvio Gesmundo Jeroen Zuiddam

Source: Linear Algebra and its Applications. 722:1-11

Subject Terms: 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)

Access URL: http://arxiv.org/abs/2307.06115

Positive moments forever: Undecidable and decidable cases

Authors: Gemma De les Coves Joshua Graf Andreas Klingler et al.

Source: Linear Algebra and its Applications. 722:255-275

Subject Terms: 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)

Access URL: http://arxiv.org/abs/2404.15053

Parameterized Max Min Feedback Vertex Set

Authors: Michael Lampis Nikolaos Melissinos Manolis Vasilakis et al.

Contributors: Michael Lampis Nikolaos Melissinos Manolis Vasilakis et al.

Source: SIAM Journal on Discrete Mathematics. 39:1587-1620

Subject Terms: 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

File Description: application/pdf

Access URL: 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

Authors: Sangam Balchandar Reddy Anjeneya Swami Kare

Source: Discrete Applied Mathematics. 380:116-127

Subject Terms: 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)

Access URL: http://arxiv.org/abs/2307.09760

Hardness transitions of star colouring and restricted star colouring

Authors: Shalu M.A. Cyriac Antony

Source: Discrete Applied Mathematics. 380:1-33

Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Computational Complexity (cs.CC)

Access URL: http://arxiv.org/abs/2309.11221

About the infinite windy firebreak location problem

Authors: Marc Demange Alessia Di Fonso Gabriele Di Stefano et al.

Source: Discrete Applied Mathematics. 378:280-293

Subject Terms: 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

Access URL: http://arxiv.org/abs/2204.05475

Parameterized Complexity of Weighted Local Hamiltonian Problems and the Quantum Exponential Time Hypothesis

Authors: Michael Bremner Zhengfeng Ji Xingjian Li et al.

Source: ACM Transactions on Quantum Computing. 6:1-36

Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, Quantum Physics, 0103 physical sciences, FOS: Physical sciences, 0102 computer and information sciences, Computational Complexity (cs.CC), Quantum Physics (quant-ph), 01 natural sciences

Access URL: http://arxiv.org/abs/2211.05325

Combinatorial and asymptotic results on the neighborhood grid

Authors: Alex McDonough Ulrich Reitebuch Martin Skrodzki

Source: Discrete Applied Mathematics. 372:48-64

Subject Terms: FOS: Computer and information sciences, E.1, F.2.2, G.2.1, Neighborhood grid, Spatial data structure, 0102 computer and information sciences, 02 engineering and technology, Young tableaux, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Mathematik, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Mathematics - Combinatorics, 05A99, Asymptotic, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), Uniqueness

Access URL: http://arxiv.org/abs/1710.03435

On the Keevash-Knox-Mycroft conjecture

Authors: Luyining Gan Jie Han

Source: Journal of Combinatorial Theory, Series B. 174:214-242

Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, FOS: Mathematics, Mathematics - Combinatorics, 0102 computer and information sciences, Combinatorics (math.CO), Computational Complexity (cs.CC), 01 natural sciences

Access URL: http://arxiv.org/abs/2202.04246

Counting stars is constant-degree optimal for detecting any planted subgraph

Authors: Xifan Yu Ilias Zadik Peiyuan Zhang

Source: Mathematical Statistics and Learning. 8:105-164

Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Statistics Theory, Data Structures and Algorithms (cs.DS), Statistics Theory (math.ST), Computational Complexity (cs.CC)

Access URL: http://arxiv.org/abs/2403.17766

A Direct Product Theorem for Quantum Communication Complexity with Applications to Device-Independent Cryptography

Authors: Rahul Jain Srijita Kundu

Source: SIAM Journal on Computing. 54:964-1020

Subject Terms: FOS: Computer and information sciences, Quantum Physics, Computer Science - Computational Complexity, 0202 electrical engineering, electronic engineering, information engineering, FOS: Physical sciences, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), Quantum Physics (quant-ph), 01 natural sciences

Access URL: http://arxiv.org/abs/2106.04299

Cluster Editing with Vertex Splitting

Authors: Faisal N. Abu-Khzam Emmanuel Arrighi Matthias Bentert et al.

Source: Discrete Applied Mathematics. 371:185-195

Subject Terms: 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

Access URL: http://arxiv.org/abs/1901.00156

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs—Part I: Algorithmic Results

Authors: Jacob Focke Dániel Marx Fionn Mc Inerney et al.

Source: ACM Transactions on Algorithms. 21:1-45

Subject Terms: 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)

Access URL: http://arxiv.org/abs/2211.04278

Special Coverings of Sets and Boolean Functions

Authors: Margaryan, Stepan

Source: American Journal of Mathematical and Computer Modelling. 10:84-97

Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computational Complexity (cs.CC)

Access URL: http://arxiv.org/abs/2501.00008

Safety Analysis in the NGAC Model

Authors: Brian Tan Ewan S. D. Davies Indrakshi Ray et al.

Source: Proceedings of the 30th ACM Symposium on Access Control Models and Technologies. :91-98

Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Cryptography and Security, Computer Science - Computer Science and Game Theory, Computational Complexity (cs.CC), Cryptography and Security (cs.CR), Computer Science and Game Theory (cs.GT)

Access URL: http://arxiv.org/abs/2505.06406

Flexible constraint satisfiability and a problem in semigroup theory

Authors: Marcel Jackson

Source: International Journal of Algebra and Computation. 35:771-821

Subject Terms: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Mathematics - Logic, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Logic in Computer Science (cs.LO), Computer Science - Computational Complexity, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 0101 mathematics, Logic (math.LO), 68Q17, 20M07, 03C05, 08B99, 08C15

Access URL: http://arxiv.org/abs/1512.03127

Random unitaries in extremely low depth

Authors: Thomas Schuster Jonas Haferkamp Hsin-Yuan Huang

Source: Science. 389:92-96

Subject Terms: FOS: Computer and information sciences, Quantum Physics, Condensed Matter - Strongly Correlated Electrons, Computer Science - Computational Complexity, Strongly Correlated Electrons (cond-mat.str-el), Computer Science - Information Theory, Information Theory (cs.IT), FOS: Physical sciences, Computational Complexity (cs.CC), Quantum Physics (quant-ph)

Access URL: http://arxiv.org/abs/2407.07754

Equilibrium Computation in First-Price Auctions with Correlated Priors

Authors: Aris Filos-Ratsikas Yiannis Giannakopoulos Alexandros Hollender et al.

Source: Proceedings of the 26th ACM Conference on Economics and Computation. :7-33

Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Computer Science and Game Theory, Computational Complexity (cs.CC), Computer Science and Game Theory (cs.GT)

Access URL: http://arxiv.org/abs/2506.05322

Complexity and Manipulation of International Kidney Exchange Programmes with Country-Specific Parameters

Authors: Rachael Colley David Manlove Daniel Paulusma et al.

Source: Proceedings of the 26th ACM Conference on Economics and Computation. :976-995

Subject Terms: FOS: Computer and information sciences, FOS: Economics and business, Computer Science - Computational Complexity, Computer Science - Computer Science and Game Theory, Economics - Theoretical Economics, Theoretical Economics (econ.TH), Computational Complexity (cs.CC), Computer Science and Game Theory (cs.GT)

Access URL: http://arxiv.org/abs/2506.04092

Low communication protocols for fair allocation of indivisible goods

Authors: Uriel Feige

Source: Proceedings of the 26th ACM Conference on Economics and Computation. :358-382

Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Computer Science and Game Theory, F.2, 91A68, 68Q11, Computational Complexity (cs.CC), Computer Science and Game Theory (cs.GT)

Access URL: http://arxiv.org/abs/2407.07641