Imagen de Portada

Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Borzechowski, Michaela, Fearnley, John, Gordon, Spencer, Savani, Rahul, Schnider, Patrick, Weber, Simon
Formato:	Preprint
Publicado:	2024
Materias:	Computational Complexity Computational Geometry Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Super Unique Tarski is in UEOPL
por: Fearnley, John, et al.
Publicado: (2024)

On Degeneracy in the P-Matroid Oriented Matroid Complementarity Problem
por: Borzechowski, Michaela, et al.
Publicado: (2023)

Monotone Contractions
por: Batziou, Eleni, et al.
Publicado: (2024)

Query-Efficient Fixpoints of $\ell_p$-Contractions
por: Haslebacher, Sebastian, et al.
Publicado: (2025)

Splitting Sandwiches Unevenly via Unique Sink Orientations and Rainbow Arrangements
por: Borzechowski, Michaela, et al.
Publicado: (2026)

Algorithms for Standard-form ILP Problems via Komlós' Discrepancy Setting
por: Gribanov, Dmitry, et al.
Publicado: (2026)

Gromov's Approximating Tree and the All-Pairs Bottleneck Paths Problem
por: Cornect, Anders, et al.
Publicado: (2024)

Optimal Preconditioning is a Geodesically Convex Optimization Problem
por: Doğan, M. Levent, et al.
Publicado: (2025)

The Complexity of Sparse Win-Lose Bimatrix Games
por: Batziou, Eleni, et al.
Publicado: (2026)

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

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

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

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

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

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

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

On the Degree Automatability of Sum-of-Squares Proofs
por: Bortolotti, Alex, et al.
Publicado: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Intrinsic Sequentiality in P: Causal Limits of Parallel Computation
por: Wei, Jing-Yuan
Publicado: (2026)

Pizza Sharing is PPA-hard
por: Deligkas, Argyrios, et al.
Publicado: (2020)

A Complete Derivation of Complex Circle Manifold (CCM) Riemannian manifold Optimization Equations
por: Tabrizi, Amirreza, et al.
Publicado: (2025)

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

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

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

Quantum Feasibility Labeling for NP-complete Vertex Coloring Problem
por: Zhan, Junpeng
Publicado: (2023)