Výsledky vyhledávání - [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC]

Inapproximability of Optimal Multi-Agent Pathfinding Problems

Autoři: Tan, Xing Grastien, Alban CEA, Contributeur MAP

Přispěvatelé: Tan, Xing Grastien, Alban CEA, Contributeur MAP

Zdroj: Proceedings of the AAAI Conference on Artificial Intelligence. 39:26707-26715

Témata: [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC]

Popis souboru: application/pdf

Přístupová URL adresa: https://cea.hal.science/cea-05151662v1

LinA: a faster approach to piecewise linear approximations using corridors and its application to mixed-integer optimization

Autoři: Codsi, Julien Ngueveu, Sandra Ulrich Gendron, Bernard a další

Přispěvatelé: Codsi, Julien Ngueveu, Sandra Ulrich Gendron, Bernard a další

Zdroj: Mathematical Programming Computation. 17:265-306

Témata: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], MINLP, overestimation, [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], underestimation, piecewise linear regression with bounded error, piecewise linear functions, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], MSC 41A15 - 90C59 - 90C30 - 90C11 - 65D07, Julia package, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], [INFO.INFO-GT] Computer Science [cs]/Computer Science and Game Theory [cs.GT], [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], guaranteed tolerance, approximation, MILP

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.science/hal-03336003v2/document
https://hal.science/hal-03336003v2
https://doi.org/10.1007/s12532-024-00274-8

Quantum state synthesis: relation with decision complexity classes and impossibility of error reduction

Autoři: Delavenne, Hugo Gall, François Le

Přispěvatelé: Delavenne, Hugo Gall, François Le

Zdroj: Quantum Information & Computation. 24:745-765

Témata: FOS: Computer and information sciences, Quantum Physics, Computer Science - Computational Complexity, FOS: Physical sciences, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Computational Complexity (cs.CC), Quantum Physics (quant-ph), [PHYS.QPHY] Physics [physics]/Quantum Physics [quant-ph]

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2407.02907
https://hal.science/hal-04634958v1
https://doi.org/10.26421/qic24.9-10-3
https://hal.science/hal-04634958v1/document

Polynomial delay hybrid algorithms to enumerate candidate keys for a relation

Autoři: Ennaoui, Karima Nourine, Lhouari

Přispěvatelé: Ennaoui, Karima Nourine, Lhouari

Zdroj: Discrete Applied Mathematics. 360:443-450

Témata: 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-DB] Computer Science [cs]/Databases [cs.DB], [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Popis souboru: application/pdf

Parameterized Restless Temporal Path

Autoři: Cauvi, Justine Viennot, Laurent

Přispěvatelé: Cauvi, Justine Viennot, Laurent

Zdroj: Lecture Notes in Computer Science ISBN: 9783032046994

Témata: FOS: Computer and information sciences, Parameterized algorithms, Temporal graphs, Computational Complexity, Data Structures and Algorithms, Interval-membership-width, Restless temporal paths, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Data Structures and Algorithms (cs.DS), Computational Complexity (cs.CC)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2507.05760
https://inria.hal.science/hal-05144137v1

Circuit Metaconstruction in Logspace for Rice-Like Complexity Lower Bounds in ANs and SGRs

Autoři: Goubault–Larrecq, Aliénor Perrot, Kévin

Přispěvatelé: Goubault–Larrecq, Aliénor Perrot, Kévin

Zdroj: Lecture Notes in Computer Science ISBN: 9783031959073
Lecture Notes in Computer Science, Crossroads of Computability and Logic: Insights, Inspirations, and Innovations
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Crossroads of Computability and Logic: Insights, Inspirations, and Innovations

Témata: Succinct graph representations, Logspace reduction, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Complexity, Automata networks

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.science/hal-05171717v1/document
https://hal.science/hal-05171717v1
https://doi.org/10.1007/978-3-031-95908-0_17

Partition Based Algorithms for Rearrangement Distances With Flexible Intergenic Regions

Autoři: Gabriel Siqueira Alexsandro Oliveira Alexandrino Andre Rodrigues Oliveira a další

Přispěvatelé: Gabriel Siqueira Alexsandro Oliveira Alexandrino Andre Rodrigues Oliveira a další

Zdroj: IEEE Transactions on Computational Biology and Bioinformatics. 22:455-468

Témata: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], Rearrangement Distance, Bioinformatics, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Genomics, Transforms, Approximation algorithms, Partitioning algorithms, Computational biology, Reversal, Intergenic Regions, Transposition, Heuristic algorithms, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Partition

Přístupová URL adresa: https://pubmed.ncbi.nlm.nih.gov/39316499

Are Botanical Trees Graph-Theoretic Trees? The Ups and Downs of the Network Approach to Plant Growth

Autoři: Varenne, Franck

Přispěvatelé: Varenne, Franck

Zdroj: Yearbook for Philosophy of Complex Systems. 1:141-156

Témata: [SDV.BIBS] Life Sciences [q-bio]/Quantitative Methods [q-bio.QM], Complex system, functional-structural models, Network, theoretical biology, Non-linearity, Topology, Trees, Remathematization of simulations, [SHS.HISPHILSO] Humanities and Social Sciences/History, Philosophy and Sociology of Sciences, [SDV.BDD] Life Sciences [q-bio]/Development Biology, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-MO] Computer Science [cs]/Modeling and Simulation, Plant modeling, Graphs, Botanical trees

Robust ordinal regression for subsets comparisons with interactions

Autoři: Gilbert, Hugo Ouaguenouni, Mohamed Öztürk, Meltem a další

Přispěvatelé: Gilbert, Hugo Ouaguenouni, Mohamed Öztürk, Meltem a další

Zdroj: European Journal of Operational Research. 320:146-159

Témata: [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], FOS: Computer and information sciences, Artificial Intelligence (cs.AI), Computer Science - Artificial Intelligence, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, Subsets comparisons, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], 02 engineering and technology, Preference elicitation, Robust ordinal regression, Positive and negative interactions

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2308.03376

On the Asymptotic Nonnegative Rank of Matrices and its Applications in Information Theory

Autoři: Chee, Yeow Meng Le, Quoc-Tung Ta, Duy Hoang a další

Přispěvatelé: Chee, Yeow Meng Le, Quoc-Tung Ta, Duy Hoang a další

Zdroj: 2024 IEEE International Symposium on Information Theory (ISIT). :1955-1960

Témata: [MATH.MATH-AC] Mathematics [math]/Commutative Algebra [math.AC], FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Information Theory, Information Theory (cs.IT), FOS: Mathematics, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], Computational Complexity (cs.CC), Mathematics - Commutative Algebra, Commutative Algebra (math.AC)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2308.07187
https://hal.science/hal-05082382v1
https://doi.org/10.1109/isit57864.2024.10619320
https://hal.science/hal-05082382v1/document

A LOCAL View of the Polynomial Hierarchy

Autoři: Reiter, Fabian

Přispěvatelé: Reiter, Fabian

Zdroj: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing. :347-357

Témata: FOS: Computer and information sciences, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Computational Complexity, Logic in Computer Science, Formal Languages and Automata Theory (cs.FL), C.2.4, F.1.1, F.1.2, F.1.3, F.4.1, F.4.3, LOCAL model, Distributed decision, Computational Complexity (cs.CC), Descriptive complexity, Logic in Computer Science (cs.LO), [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Distributed, Parallel, and Cluster Computing, Distributed, Parallel, and Cluster Computing (cs.DC), Formal Languages and Automata Theory, Polynomial hierarchy, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Přístupová URL adresa: http://arxiv.org/abs/2305.09538
https://hal.science/hal-04719424v1
https://doi.org/10.1145/3662158.3662774

Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies

Autoři: Dominique Barth Thierry Mautor Dimitri Watel a další

Přispěvatelé: Dominique Barth Thierry Mautor Dimitri Watel a další

Zdroj: Journal of Global Optimization. 89:223-257

Témata: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], FOS: Computer and information sciences, Computer Science - Computational Complexity, Complexity Approximability Electrical network flow Tree topology, Approximability, Electrical network flow, Complexity, Computational Complexity (cs.CC), Tree topology, 7. Clean energy

Přístupová URL adresa: http://arxiv.org/abs/2311.11707

Tightening I/O Lower Bounds through the Hourglass Dependency Pattern

Autoři: Lionel Eyraud-Dubois Guillaume Iooss Julien Langou a další

Přispěvatelé: Lionel Eyraud-Dubois Guillaume Iooss Julien Langou a další

Zdroj: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures. :183-193

Témata: FOS: Computer and information sciences, Data Movement Lower Bound, Computer Science - Computational Complexity, Computer Science - Distributed, Parallel, and Cluster Computing, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], I/O complexity, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], 0102 computer and information sciences, Distributed, Parallel, and Cluster Computing (cs.DC), 0101 mathematics, Computational Complexity (cs.CC), 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2404.16443
https://inria.hal.science/hal-04555744v1

La boucle infernale. Croissance numérique, besoins énergétiques, impacts environnementaux et préoccupations sécuritaires

Autoři: Dirks, Gary Grumbach, Stéphane van der Leeuw, Sander a další

Přispěvatelé: Dirks, Gary Grumbach, Stéphane van der Leeuw, Sander a další

Zdroj: Hérodote. :25-44

Témata: [INFO.INFO-CY] Computer Science [cs]/Computers and Society [cs.CY], [INFO.INFO-SI] Computer Science [cs]/Social and Information Networks [cs.SI], [INFO.INFO-DB] Computer Science [cs]/Databases [cs.DB], [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], [SHS] Humanities and Social Sciences, [INFO] Computer Science [cs], [SHS.SCIPO] Humanities and Social Sciences/Political science

Přístupová URL adresa: https://hal.science/hal-04903566v1
https://doi.org/10.3917/her.195.0025

On the complexity of Client-Waiter and Waiter-Client games ; Complexité des jeux Client-Waiter et Waiter-Client

Autoři: Gledel, Valentin Oijid, Nacim Tavenas, Sébastien a další

Přispěvatelé: Gledel, Valentin Oijid, Nacim Tavenas, Sébastien a další

Zdroj: 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025)
International Colloquium on Automata, Languages, and Programming (ICALP)
https://hal.science/hal-04643212
International Colloquium on Automata, Languages, and Programming (ICALP), Jul 2025, Aarhus, Denmark. ⟨10.4230/LIPIcs.ICALP.2025.89⟩

Témata: Maker-Breaker, reductions and completeness, Theory of computation → Problems, Mathematics of computing → Hypergraphs, Mathematics of computing → Combinatorial algorithms, PSPACE-complete, Waiter-Client, Client-Waiter, positional games, FPT, Complexity, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

Geografické téma: Aarhus, Denmark

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2407.06777; ARXIV: 2407.06777

Dostupnost: https://hal.science/hal-04643212
https://hal.science/hal-04643212v1/document
https://hal.science/hal-04643212v1/file/On%20the%20complexity%20of%20Waiter-Client%20and%20Client-Waiter%20games.pdf
https://doi.org/10.4230/LIPIcs.ICALP.2025.89

Complexity, algorithmic, and computational aspects of a dial-a-ride type problem

Autoři: Baïou, Mourad Colares, Rafael Kerivin, Hervé a další

Přispěvatelé: Baïou, Mourad Colares, Rafael Kerivin, Hervé a další

Zdroj: European Journal of Operational Research. 310:552-565

Témata: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], 0211 other engineering and technologies, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 01 natural sciences

Přístupová URL adresa: https://hal.science/hal-04981410v1
https://doi.org/10.1016/j.ejor.2023.03.018

Efficient Simulation of Parametrized Quantum Circuits under Nonunital Noise through Pauli Backpropagation

Autoři: Martinez, Victor Angrisani, Armando Pankovets, Ekaterina a další

Přispěvatelé: Martinez, Victor Angrisani, Armando Pankovets, Ekaterina a další

Zdroj: Martinez, V, Angrisani, A, Pankovets, E, Fawzi, O & Stilck França, D 2025, ' Efficient Simulation of Parametrized Quantum Circuits under Nonunital Noise through Pauli Backpropagation ', Physical Review Letters, vol. 134, no. 25, 250602 . https://doi.org/10.1103/j1gg-s6zb

Témata: FOS: Computer and information sciences, Quantum Physics, Computational Complexity, FOS: Physical sciences, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Mathematical Physics (math-ph), [PHYS.MPHY] Physics [physics]/Mathematical Physics [math-ph], Computational Complexity (cs.CC), Quantum Physics (quant-ph), [PHYS.QPHY] Physics [physics]/Quantum Physics [quant-ph], Mathematical Physics

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2501.13050
https://curis.ku.dk/ws/files/460335571/Efficient_simulation.pdf

Quantum query complexity of Boolean functions under indefinite causal order

Autoři: Abbott, Alastair Mhalla, Mehdi Pocreau, Pierre a další

Přispěvatelé: Abbott, Alastair Mhalla, Mehdi Pocreau, Pierre a další

Zdroj: Physical Review Research, Vol 6, Iss 3, p L032020 (2024)

Témata: Quantum Physics, [PHYS.QPHY]Physics [physics]/Quantum Physics [quant-ph], Physics, QC1-999, 0103 physical sciences, FOS: Physical sciences, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], 0102 computer and information sciences, Quantum Physics (quant-ph), 01 natural sciences, [PHYS.QPHY] Physics [physics]/Quantum Physics [quant-ph]

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2307.10285
https://doaj.org/article/02099d886d4d44ab8085dae8591d958c

On the Power of Homogeneous Algebraic Formulas

Autoři: Fournier, Hervé Limaye, Nutan Srinivasan, Srikanth a další

Přispěvatelé: Fournier, Hervé Limaye, Nutan Srinivasan, Srikanth a další

Zdroj: Fournier, H, Limaye, N, Srinivasan, S & Tavenas, S 2024, On the Power of Homogeneous Algebraic Formulas . in B Mohar, I Shinkar & R O�Donnell (eds), STOC 2024-Proceedings of the 56th Annual ACM Symposium on Theory of Computing . Association for Computing Machinery, pp. 141-151, 56th Annual ACM Symposium on Theory of Computing, STOC 2024, Vancouver, Canada, 24/06/2024 . https://doi.org/10.1145/3618260.3649760

Témata: Formula Homogenization ACM Reference, Algebraic Formulas, Formula Homogenization, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Theory of computation → Algebraic complexity theory, Circuit complexity Algebraic Formulas

Popis souboru: application/pdf

Přístupová URL adresa: https://curis.ku.dk/ws/files/431873603/On_the_Power_of_Homogeneous_Algebraic_Formula.pdf
https://hal.science/hal-04683830v1/document
https://doi.org/10.1145/3618260.3649760
https://hal.science/hal-04683830v1

Group Order Logic

Autoři: Dahan, Anatole Value from Data (VALDA) Département d'informatique - ENS-PSL (DI-ENS) a další

Přispěvatelé: Dahan, Anatole Value from Data (VALDA) Département d'informatique - ENS-PSL (DI-ENS) a další

Zdroj: LICS 2025 - Logic in Computer Science ; https://hal.science/hal-05083596 ; LICS 2025 - Logic in Computer Science, Jun 2025, Singapore, Singapore. ⟨10.48550/arXiv.2505.15359⟩

Témata: Descriptive Complexity, Logic for P, Finite Model Theory, Computational Group Theory, Fixed-point logic, Schreier-Sims algorithm, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [MATH.MATH-GR]Mathematics [math]/Group Theory [math.GR]

Geografické téma: Singapore

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2505.15359; ARXIV: 2505.15359

Dostupnost: https://hal.science/hal-05083596
https://hal.science/hal-05083596v1/document
https://hal.science/hal-05083596v1/file/article.pdf
https://doi.org/10.48550/arXiv.2505.15359