Výsledky vyhľadávania - "computer science - computational complexity"

The next gap in the subrank of 3-tensors

Autori: Fulvio Gesmundo Jeroen Zuiddam

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

Predmety: 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)

Prístupová URL adresa: http://arxiv.org/abs/2307.06115

Positive moments forever: Undecidable and decidable cases

Autori: Gemma De les Coves Joshua Graf Andreas Klingler a ďalší

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

Predmety: 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)

Prístupová URL adresa: http://arxiv.org/abs/2404.15053

Parameterized Max Min Feedback Vertex Set

Autori: Michael Lampis Nikolaos Melissinos Manolis Vasilakis a ďalší

Prispievatelia: Michael Lampis Nikolaos Melissinos Manolis Vasilakis a ďalší

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

Predmety: 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

Popis súboru: application/pdf

Prístupová URL adresa: 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

Autori: Sangam Balchandar Reddy Anjeneya Swami Kare

Zdroj: Discrete Applied Mathematics. 380:116-127

Predmety: 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)

Prístupová URL adresa: http://arxiv.org/abs/2307.09760

Hardness transitions of star colouring and restricted star colouring

Autori: Shalu M.A. Cyriac Antony

Zdroj: Discrete Applied Mathematics. 380:1-33

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

Prístupová URL adresa: http://arxiv.org/abs/2309.11221

About the infinite windy firebreak location problem

Autori: Marc Demange Alessia Di Fonso Gabriele Di Stefano a ďalší

Zdroj: Discrete Applied Mathematics. 378:280-293

Predmety: 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

Prístupová URL adresa: http://arxiv.org/abs/2204.05475

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

Autori: Michael Bremner Zhengfeng Ji Xingjian Li a ďalší

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

Predmety: 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

Prístupová URL adresa: http://arxiv.org/abs/2211.05325

Combinatorial and asymptotic results on the neighborhood grid

Autori: Alex McDonough Ulrich Reitebuch Martin Skrodzki

Zdroj: Discrete Applied Mathematics. 372:48-64

Predmety: 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

Prístupová URL adresa: http://arxiv.org/abs/1710.03435

On the Keevash-Knox-Mycroft conjecture

Autori: Luyining Gan Jie Han

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

Predmety: 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

Prístupová URL adresa: http://arxiv.org/abs/2202.04246

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

Autori: Xifan Yu Ilias Zadik Peiyuan Zhang

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

Predmety: 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)

Prístupová URL adresa: http://arxiv.org/abs/2403.17766

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

Autori: Rahul Jain Srijita Kundu

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

Predmety: 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

Prístupová URL adresa: http://arxiv.org/abs/2106.04299

Cluster Editing with Vertex Splitting

Autori: Faisal N. Abu-Khzam Emmanuel Arrighi Matthias Bentert a ďalší

Zdroj: Discrete Applied Mathematics. 371:185-195

Predmety: 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

Prístupová URL adresa: http://arxiv.org/abs/1901.00156

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

Autori: Jacob Focke Dániel Marx Fionn Mc Inerney a ďalší

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

Predmety: 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)

Prístupová URL adresa: http://arxiv.org/abs/2211.04278

Special Coverings of Sets and Boolean Functions

Autori: Margaryan, Stepan

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

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

Prístupová URL adresa: http://arxiv.org/abs/2501.00008

Safety Analysis in the NGAC Model

Autori: Brian Tan Ewan S. D. Davies Indrakshi Ray a ďalší

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

Predmety: 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)

Prístupová URL adresa: http://arxiv.org/abs/2505.06406

Flexible constraint satisfiability and a problem in semigroup theory

Autori: Marcel Jackson

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

Predmety: 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

Prístupová URL adresa: http://arxiv.org/abs/1512.03127

Random unitaries in extremely low depth

Autori: Thomas Schuster Jonas Haferkamp Hsin-Yuan Huang

Zdroj: Science. 389:92-96

Predmety: 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)

Prístupová URL adresa: http://arxiv.org/abs/2407.07754

Equilibrium Computation in First-Price Auctions with Correlated Priors

Autori: Aris Filos-Ratsikas Yiannis Giannakopoulos Alexandros Hollender a ďalší

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

Predmety: 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)

Prístupová URL adresa: http://arxiv.org/abs/2506.05322

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

Autori: Rachael Colley David Manlove Daniel Paulusma a ďalší

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

Predmety: 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)

Prístupová URL adresa: http://arxiv.org/abs/2506.04092

Low communication protocols for fair allocation of indivisible goods

Autori: Uriel Feige

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

Predmety: 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)

Prístupová URL adresa: http://arxiv.org/abs/2407.07641