:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Bortolotti, Alex, Mastrolilli, Monaldo, Vargas, Luis Felipe
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Computational Complexity Optimization and Control
Accesso online:	https://arxiv.org/abs/2504.17756
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

On the Bit Size of Sum-of-Squares Proofs for Symmetric Formulations
di: Bortolotti, Alex, et al.
Pubblicazione: (2025)

Computational complexity of sum-of-squares bounds for copositive programs
di: Palomba, Marilena, et al.
Pubblicazione: (2025)

Ideal Membership Problem for Boolean Minority and Dual Discriminator
di: Bharathi, Arpitha P., et al.
Pubblicazione: (2024)

Sum-of-Squares & Gaussian Processes I: Certification
di: Sandhu, Juspreet Singh, et al.
Pubblicazione: (2024)

Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
di: Encz, Koppány István, et al.
Pubblicazione: (2025)

The Integrality Gap of the Traveling Salesman Problem is $4/3$ if the LP Solution Has at Most $n+6$ Non-zero Components
di: Villa, Tullio, et al.
Pubblicazione: (2025)

On the integrality Gap of Small Asymmetric Traveling Salesman Problems: A Polyhedral and Computational Approach
di: Vercesi, Eleonora, et al.
Pubblicazione: (2025)

On the Complexity of p-Order Cone Programs
di: Blanco, Víctor, et al.
Pubblicazione: (2025)

Efficient LP warmstarting for linear modifications of the constraint matrix
di: Derval, Guillaume, et al.
Pubblicazione: (2025)

Parameterized complexity of scheduling unit-time jobs with generalized precedence constraints
di: Büsing, Christina, et al.
Pubblicazione: (2025)

Benchmarking of Quantum and Classical Computing in Large-Scale Dynamic Portfolio Optimization Under Market Frictions
di: Chen, Ying, et al.
Pubblicazione: (2025)

Counterfactual Explanations for Integer Optimization Problems
di: Engelhardt, Felix, et al.
Pubblicazione: (2025)

A parameterized linear formulation of the integer hull
di: Eisenbrand, Friedrich, et al.
Pubblicazione: (2025)

Iterative Optimization of Multidimensional Functions on Turing Machines under Performance Guarantees
di: Boche, Holger, et al.
Pubblicazione: (2025)

On a class of interdiction problems with partition matroids: complexity and polynomial-time algorithms
di: Ketkov, Sergey S., et al.
Pubblicazione: (2024)

Hardness of some optimization problems over correlation polyhedra
di: Caprara, Alberto, et al.
Pubblicazione: (2026)

On the Induced Norms of Matrices and Grothendieck problems
di: Truong, Lan V., et al.
Pubblicazione: (2026)

Constrained Nonnegative Gram Feasibility is $\exists\mathbb{R}$-Complete
di: Majumdar, Angshul
Pubblicazione: (2026)

Avoiding Deadlocks via Weak Deadlock Sets
di: Oriolo, Gianpaolo, et al.
Pubblicazione: (2024)

A System-Dynamic Based Simulation and Bayesian Optimization for Inventory Management
di: Maitra, Sarit
Pubblicazione: (2024)

Learning complexity of gradient descent and conjugate gradient algorithms
di: Jiao, Xianqi, et al.
Pubblicazione: (2024)

Geometric and computational hardness of bilevel programming
di: Bolte, Jérôme, et al.
Pubblicazione: (2024)

Policy Gradient Algorithms in Average-Reward Multichain MDPs
di: Lee, Jongmin, et al.
Pubblicazione: (2026)

The Complexity of Computing KKT Solutions of Quadratic Programs
di: Fearnley, John, et al.
Pubblicazione: (2023)

Reduction from the partition problem: Dynamic lot sizing problem with polynomial complexity
di: Sim, Chee-Khian
Pubblicazione: (2024)

Tight Time Complexities in Parallel Stochastic Optimization with Arbitrary Computation Dynamics
di: Tyurin, Alexander
Pubblicazione: (2024)

On Big-M Reformulations of Bilevel Linear Programs: Hardness of A Posteriori Verification
di: Ketkov, Sergey S., et al.
Pubblicazione: (2026)

A parallel framework for graphical optimal transport
di: Fan, Jiaojiao, et al.
Pubblicazione: (2024)

The Complexity of Recognizing Facets for the Knapsack Polytope
di: Chen, Rui, et al.
Pubblicazione: (2022)

Information Redistribution Under Reductions in NP Search
di: Wei, Jing-Yuan
Pubblicazione: (2026)

Lower bounds for the integrality gap of the bi-directed cut formulation of the Steiner Tree Problem
di: Bernardelli, Ambrogio Maria, et al.
Pubblicazione: (2024)

Query-Efficient Zeroth-Order Algorithms for Nonconvex Constrained Optimization
di: Jin, Ruiyang, et al.
Pubblicazione: (2025)

Optimal Sensor and Actuator Selection for Factored Markov Decision Processes: Complexity, Approximability and Algorithms
di: Bhargav, Jayanth, et al.
Pubblicazione: (2024)

Real Stability and Log Concavity are coNP-Hard
di: Chin, Tracy
Pubblicazione: (2024)

Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents
di: Borzechowski, Michaela, et al.
Pubblicazione: (2024)

Decentralized Projection-free Online Upper-Linearizable Optimization with Applications to DR-Submodular Optimization
di: Lu, Yiyang, et al.
Pubblicazione: (2025)

(Sub)Exponential Quantum Speedup for Optimization
di: Leng, Jiaqi, et al.
Pubblicazione: (2025)

The Complexity of Finding Local Optima in Contrastive Learning
di: Yan, Jingming, et al.
Pubblicazione: (2025)

Solving The Travelling Salesman Problem Using A Single Qubit
di: Goswami, Kapil, et al.
Pubblicazione: (2024)

Linear Equations with Min and Max Operators: Computational Complexity
di: Chatterjee, Krishnendu, et al.
Pubblicazione: (2024)