Search Results - "[INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC]"

1

Academic Journal

Inapproximability of Optimal Multi-Agent Pathfinding Problems

Contributors: CEA, Contributeur MAP

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

Subject Terms: [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC]

File Description: application/pdf

Access URL: https://cea.hal.science/cea-05151662v1

View record at OpenAIRE Full Text Finder

2

Academic Journal

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

Authors: Codsi, Julien, Ngueveu, Sandra Ulrich, Gendron, Bernard

Contributors: Ngueveu, Sandra Ulrich, Centre Interuniversitaire de Recherche sur les Réseaux d'Entreprise, la Logistique et le Transport (CIRRELT), École Polytechnique de Montréal (EPM)-Université de Montréal (UdeM)-HEC Montréal (HEC Montréal), Université de Montréal (UdeM), Princeton University, Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT), Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes (LAAS-ROC), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole)

Source: Mathematical Programming Computation. 17:265-306

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

File Description: application/pdf

Access URL: https://hal.science/hal-03336003v2/document
https://hal.science/hal-03336003v2
https://doi.org/10.1007/s12532-024-00274-8

View record at OpenAIRE View record at Springer

Linked Full Text

3

Academic Journal

Polynomial delay hybrid algorithms to enumerate candidate keys for a relation

Authors: Ennaoui, Karima, Nourine, Lhouari

Contributors: Nourine, Lhouari

Source: Discrete Applied Mathematics. 360:443-450

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

File Description: application/pdf

View record from ScienceDirect

Linked Full Text

4

Book

Parameterized Restless Temporal Path

Authors: Cauvi, Justine, Viennot, Laurent

Contributors: Cauvi, Justine

Source: Lecture Notes in Computer Science ISBN: 9783032046994

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

File Description: application/pdf

Access URL: http://arxiv.org/abs/2507.05760
https://inria.hal.science/hal-05144137v1

View record at OpenAIRE

5

Academic Journal

Partition Based Algorithms for Rearrangement Distances With Flexible Intergenic Regions

Authors: Gabriel Siqueira, Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira, Géraldine Jean, Guillaume Fertin, Zanoni Dias

Contributors: Institute of Computing Campinas (IC), Universidade Estadual de Campinas = University of Campinas (UNICAMP), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT)-NANTES UNIVERSITÉ - École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ), Combinatoire et Bioinformatique (LS2N - équipe COMBI), Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN)-École Centrale de Nantes (ECN)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT), LS2N_combi

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

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

Access URL: https://pubmed.ncbi.nlm.nih.gov/39316499

6

Academic Journal

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

Authors: Varenne, Franck

Contributors: Varenne, Franck

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

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

7

Academic Journal

Robust ordinal regression for subsets comparisons with interactions

Authors: Gilbert, Hugo, Ouaguenouni, Mohamed, Öztürk, Meltem, Spanjaard, Olivier

Contributors: Sorbonne Université, Gestionnaire HAL 7

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

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

File Description: application/pdf

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

View record at OpenAIRE View record from ScienceDirect

Linked Full Text

8

Academic Journal

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

Authors: Chee, Yeow Meng, Le, Quoc-Tung, Ta, Duy Hoang

Contributors: LE, QUOC-TUNG

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

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

File Description: application/pdf

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

View record at OpenAIRE

9

Academic Journal

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

Authors: Dirks, Gary, Grumbach, Stéphane, van der Leeuw, Sander

Contributors: Grumbach, Stephane

Source: Hérodote. :25-44

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

Access URL: https://hal.science/hal-04903566v1
https://doi.org/10.3917/her.195.0025

10

Academic Journal

An Efficient and Scalable Approach to Build Co-occurrence Matrix for DNN's Embedding Layer

Authors: Petit, Quentin, Li, Chong, Emad, Nahid

Contributors: Petit, Quentin, Huawei Technologies France, Huawei Technologies France Boulogne-Billancourt, Maison de la Simulation (MDLS), Université de Versailles Saint-Quentin-en-Yvelines (UVSQ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Université Paris-Saclay, Laboratoire d'Informatique Parallélisme Réseaux Algorithmes Distribués (LI-PaRAD), Université de Versailles Saint-Quentin-en-Yvelines (UVSQ)

Source: Proceedings of the 38th ACM International Conference on Supercomputing. :286-297

Subject Terms: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DC]Computer Science [cs]/Distributed, Information extraction, Natural language processing, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Parallel, Distributed computing, Sparse matrix, Computing methodologies → Massively parallel algorithms, and Cluster Computing [cs.DC], Large-scale data analytics, Control methods Deep Learning, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Co-occurrence matrix, Computing methodologies → Massively parallel algorithms Natural language processing Information extraction Control methods Deep Learning, Embedding

File Description: application/pdf

Access URL: https://hal.science/hal-04719623v1
https://hal.science/hal-04719623v1/document
https://doi.org/10.1145/3650200.3656629

View record at OpenAIRE

11

Academic Journal

Tightening I/O Lower Bounds through the Hourglass Dependency Pattern

Authors: Lionel Eyraud-Dubois, Guillaume Iooss, Julien Langou, Fabrice Rastello

Contributors: Iooss, Guillaume

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

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

File Description: application/pdf

Access URL: http://arxiv.org/abs/2404.16443
https://inria.hal.science/hal-04555744v1

View record at OpenAIRE

12

Academic Journal

A LOCAL View of the Polynomial Hierarchy

Authors: Reiter, Fabian

Contributors: Reiter, Fabian

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

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

Access URL: http://arxiv.org/abs/2305.09538
https://hal.science/hal-04719424v1
https://doi.org/10.1145/3662158.3662774

View record at OpenAIRE

13

Academic Journal

On the Power of Homogeneous Algebraic Formulas

Authors: Fournier, Hervé, Limaye, Nutan, Srinivasan, Srikanth, Tavenas, Sébastien

Contributors: Mohar, Bojan, Shinkar, Igor, O�Donnell, Ryan, Tavenas, Sébastien

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

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

File Description: application/pdf

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

View record at OpenAIRE

14

Academic Journal

DeepLSH: Deep Locality-Sensitive Hash Learning for Fast and Efficient Near-Duplicate Crash Report Detection

Authors: Youcef Remil, Anes Bendimerad, Romain Mathonat, Chedy Raïssi, Mehdi Kaytoue

Contributors: Remil, Youcef

Source: Proceedings of the IEEE/ACM 46th International Conference on Software Engineering. :1-12

Subject Terms: Locality-sensitive hashing, [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], FOS: Computer and information sciences, Siamese neural networks, Approximate nearest neighbors, Computer Science - Artificial Intelligence, [INFO.INFO-SE] Computer Science [cs]/Software Engineering [cs.SE], 02 engineering and technology, [INFO] Computer Science [cs], 01 natural sciences, Stack trace similarity, Software Engineering (cs.SE), Computer Science - Software Engineering, Artificial Intelligence (cs.AI), 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Crash deduplication Stack trace similarity Approximate nearest neighbors Locality-sensitive hashing Siamese neural networks, 0101 mathematics, Crash deduplication

File Description: application/pdf

Access URL: http://arxiv.org/abs/2310.06703
https://hal.science/hal-04236085v1

View record at OpenAIRE

15

Academic Journal

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

Authors: Delavenne, Hugo, Gall, François Le

Contributors: Delavenne, Hugo

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

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

File Description: application/pdf

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

View record at OpenAIRE

16

Academic Journal

Nonatomic Non-Cooperative Neighbourhood Balancing Games

Authors: Auger, David, Cohen, Johanne, Lobstein, Antoine

Contributors: Données et algorithmes pour une ville intelligente et durable - DAVID (DAVID), Université de Versailles Saint-Quentin-en-Yvelines (UVSQ), Laboratoire Interdisciplinaire des Sciences du Numérique (LISN), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Graphes, Algorithmes et Combinatoire - LISN (GALaC), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Algorithmes, Apprentissage et Calcul (AAC), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Algorithmes, Apprentissage et Calcul (AAC)

Source: Fundamenta Informaticae. 191:239-268

Subject Terms: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 0211 other engineering and technologies, [SCCO.COMP]Cognitive science/Computer science, 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, Computer Science - Computer Science and Game Theory, [INFO]Computer Science [cs], Computer Science - Discrete Mathematics, Computer Science and Game Theory (cs.GT)

File Description: application/pdf

Access URL: http://arxiv.org/abs/2303.08507
https://fi.episciences.org/11080

View record at OpenAIRE

17

Academic Journal

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

Authors: Martinez, Victor, Angrisani, Armando, Pankovets, Ekaterina, Fawzi, Omar, Stilck França, Daniel

Contributors: Fawzi, Omar

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

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