Image de couverture de livre

On the Complexity of Combinatorial Optimization on Fixed Structures

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Megiddo, Nimrod
Format:	Preprint
Publié:	2024
Sujets:	Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization
par: Figueira, José Rui, et autres
Publié: (2024)

A Note on the Complexity of Bilevel Linear Programs in Fixed Dimensions
par: Ketkov, Sergey S., et autres
Publié: (2025)

On the Smoothed Complexity of Combinatorial Local Search
par: Giannakopoulos, Yiannis, et autres
Publié: (2022)

Structure in Communication Complexity and Constant-Cost Complexity Classes
par: Hatami, Hamed, et autres
Publié: (2024)

Reinforced Generation of Combinatorial Structures: Ramsey Numbers
par: Nagda, Ansh, et autres
Publié: (2026)

Separations between Combinatorial Measures for Transitive Functions
par: Chakraborty, Sourav, et autres
Publié: (2021)

The Mystery Deepens: On the Query Complexity of Tarski Fixed Points
par: Chen, Xi, et autres
Publié: (2026)

Spline Quantile Regression
par: Li, Ta-Hsin, et autres
Publié: (2025)

Reasonable Bounds for Combinatorial Lines of Length Three
par: Bhangale, Amey, et autres
Publié: (2024)

Finding Diverse Solutions in Combinatorial Problems with a Distributive Lattice Structure
par: de Berg, Mark, et autres
Publié: (2025)

Resolution Over Linear Equations: Combinatorial Games for Tree-like Size and Space
par: Gryaznov, Svyatoslav, et autres
Publié: (2024)

The Randomized Query Complexity of Finding a Tarski Fixed Point on the Boolean Hypercube
par: Brânzei, Simina, et autres
Publié: (2024)

Reinforced Generation of Combinatorial Structures: Hardness of Approximation
par: Nagda, Ansh, et autres
Publié: (2025)

Algorithmic Structure in Subset Sum: Deterministic In-Bound Navigation and the Counting Complexity Divide
par: Nkosi, Thami
Publié: (2025)

Counting Triangulations of Fixed Cardinal Degrees
par: Chambers, Erin, et autres
Publié: (2025)

Fixed-parameter tractability of canonical polyadic decomposition over finite fields
par: Yang, Jason
Publié: (2024)

Combinatorial refinement on circulant graphs
par: Kluge, Laurence
Publié: (2022)

Heuristics for Combinatorial Optimization via Value-based Reinforcement Learning: A Unified Framework and Analysis
par: Davidovich, Orit, et autres
Publié: (2025)

$\#$W[1] = $\text{FPT}$: Fixed-Parameter Tractable Exact Algorithms for the $\#k$-Matching Problem
par: Yi, Yongming
Publié: (2026)

Pushing Blocks without Fixed Walls via Checkable Gizmos: Push-1 is PSPACE-Complete
par: MIT Hardness Group, et autres
Publié: (2025)

On the Complexity of Identification in Linear Structural Causal Models
par: Dörfler, Julian, et autres
Publié: (2024)

Fixed Parameter Tractable Linearizability Monitoring
par: Han, Lee Zheng, et autres
Publié: (2025)

From Proof Complexity to Circuit Complexity via Interactive Protocols
par: Arteche, Noel, et autres
Publié: (2024)

Complex Boolean Turing Machines: An Algebraic Semantic Framework for Computational Complexity
par: Zheng, Bojin, et autres
Publié: (2026)

Information-Based Complexity vs Computational Complexity in Phaseless Polynomial Interpolation
par: Przybyłek, Michał R., et autres
Publié: (2026)

Matrix Chaos Inequalities and Chaos of Combinatorial Type
par: Bandeira, Afonso S., et autres
Publié: (2024)

Query Complexity with Unknowns
par: Mande, Nikhil S., et autres
Publié: (2024)

The Complexity of Tensor Rank
par: Schaefer, Marcus, et autres
Publié: (2016)

Pseudodeterministic Communication Complexity
par: Göös, Mika, et autres
Publié: (2025)

On Condensation of Block Sensitivity, Certificate Complexity and the $\mathsf{AND}$ (and $\mathsf{OR}$) Decision Tree Complexity
par: Nalli, Sai Soumya, et autres
Publié: (2026)

The Complexity of Min-Max Optimization with Product Constraints
par: Bernasconi, Martino, et autres
Publié: (2026)

A Structural Complexity Analysis of Hierarchical Task Network Planning
par: Brand, Cornelius, et autres
Publié: (2024)

The Radical Solution and Computational Complexity
par: Zheng, Bojin, et autres
Publié: (2024)

The Computational Complexity of Factored Graphs
par: Gupta, Shreya, et autres
Publié: (2024)

On the Complexity of Hazard-Free Formulas
par: Arazi, Leah London, et autres
Publié: (2024)

The Complexity of Order-Finding for ROABPs
par: Bhargava, Vishwas, et autres
Publié: (2024)

Separations in Proof Complexity and TFNP
par: Göös, Mika, et autres
Publié: (2022)

Random Permutations in Computational Complexity
par: Hitchcock, John M., et autres
Publié: (2025)

Communication Complexity is NP-hard
par: Hirahara, Shuichi, et autres
Publié: (2025)

Computational Complexity of UAP Reverse Engineering: A Formal Analysis of Automaton Identification and Data Complexity
par: Daghbouche, Karim
Publié: (2025)