Image de couverture de livre

Constrained Nonnegative Gram Feasibility is $\exists\mathbb{R}$-Complete

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Majumdar, Angshul
Format:	Preprint
Publié:	2026
Sujets:	Optimization and Control Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

$\exists\mathbb{R}$-Completeness of Tensor Degeneracy and a Derandomization Barrier for Hyperdeterminants
par: Majumdar, Angshul
Publié: (2026)

Tensor Spectral Threshold is $\exists\mathbb{R}$-Hard
par: Majumdar, Angshul
Publié: (2026)

Affine Rank Minimization is ER Complete
par: Majumdar, Angshul
Publié: (2026)

Query-Efficient Zeroth-Order Algorithms for Nonconvex Constrained Optimization
par: Jin, Ruiyang, et autres
Publié: (2025)

How Hard Is Continuous Clustering? Lower Bounds from the Existential Theory of the Reals
par: Majumdar, Angshul
Publié: (2026)

Universal NP-Hardness of Clustering under General Utilities
par: Majumdar, Angshul
Publié: (2026)

Hardness of some optimization problems over correlation polyhedra
par: Caprara, Alberto, et autres
Publié: (2026)

On the Induced Norms of Matrices and Grothendieck problems
par: Truong, Lan V., et autres
Publié: (2026)

Policy Gradient Algorithms in Average-Reward Multichain MDPs
par: Lee, Jongmin, et autres
Publié: (2026)

On Big-M Reformulations of Bilevel Linear Programs: Hardness of A Posteriori Verification
par: Ketkov, Sergey S., et autres
Publié: (2026)

Information Redistribution Under Reductions in NP Search
par: Wei, Jing-Yuan
Publié: (2026)

On the Complexity of p-Order Cone Programs
par: Blanco, Víctor, et autres
Publié: (2025)

On a class of interdiction problems with partition matroids: complexity and polynomial-time algorithms
par: Ketkov, Sergey S., et autres
Publié: (2024)

Efficient LP warmstarting for linear modifications of the constraint matrix
par: Derval, Guillaume, et autres
Publié: (2025)

Avoiding Deadlocks via Weak Deadlock Sets
par: Oriolo, Gianpaolo, et autres
Publié: (2024)

On the Degree Automatability of Sum-of-Squares Proofs
par: Bortolotti, Alex, et autres
Publié: (2025)

Parameterized complexity of scheduling unit-time jobs with generalized precedence constraints
par: Büsing, Christina, et autres
Publié: (2025)

A System-Dynamic Based Simulation and Bayesian Optimization for Inventory Management
par: Maitra, Sarit
Publié: (2024)

Learning complexity of gradient descent and conjugate gradient algorithms
par: Jiao, Xianqi, et autres
Publié: (2024)

Benchmarking of Quantum and Classical Computing in Large-Scale Dynamic Portfolio Optimization Under Market Frictions
par: Chen, Ying, et autres
Publié: (2025)

Geometric and computational hardness of bilevel programming
par: Bolte, Jérôme, et autres
Publié: (2024)

Counterfactual Explanations for Integer Optimization Problems
par: Engelhardt, Felix, et autres
Publié: (2025)

A parameterized linear formulation of the integer hull
par: Eisenbrand, Friedrich, et autres
Publié: (2025)

The Complexity of Computing KKT Solutions of Quadratic Programs
par: Fearnley, John, et autres
Publié: (2023)

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

Tight Time Complexities in Parallel Stochastic Optimization with Arbitrary Computation Dynamics
par: Tyurin, Alexander
Publié: (2024)

Iterative Optimization of Multidimensional Functions on Turing Machines under Performance Guarantees
par: Boche, Holger, et autres
Publié: (2025)

A parallel framework for graphical optimal transport
par: Fan, Jiaojiao, et autres
Publié: (2024)

The Complexity of Recognizing Facets for the Knapsack Polytope
par: Chen, Rui, et autres
Publié: (2022)

Quantum Feasibility Labeling for NP-complete Vertex Coloring Problem
par: Zhan, Junpeng
Publié: (2023)

Optimal Sensor and Actuator Selection for Factored Markov Decision Processes: Complexity, Approximability and Algorithms
par: Bhargav, Jayanth, et autres
Publié: (2024)

Towards Exponential Quantum Improvements in Solving Cardinality-Constrained Binary Optimization
par: Yuan, Haomu, et autres
Publié: (2026)

Real Stability and Log Concavity are coNP-Hard
par: Chin, Tracy
Publié: (2024)

Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems
par: Blanchard, Moise
Publié: (2024)

Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents
par: Borzechowski, Michaela, et autres
Publié: (2024)

Completeness in the Polynomial Hierarchy for many natural Problems in Bilevel and Robust Optimization
par: Grüne, Christoph, et autres
Publié: (2023)

A Complete Derivation of Complex Circle Manifold (CCM) Riemannian manifold Optimization Equations
par: Tabrizi, Amirreza, et autres
Publié: (2025)

Intrinsic Sequentiality in P: Causal Limits of Parallel Computation
par: Wei, Jing-Yuan
Publié: (2026)

Strassen's support functionals coincide with the quantum functionals
par: Sakabe, Keiya, et autres
Publié: (2026)

Intrinsic Information Flow in Structureless NP Search
par: Wei, Jing-Yuan
Publié: (2026)