Imagen de Portada

Information Redistribution Under Reductions in NP Search

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Wei, Jing-Yuan
Formato:	Preprint
Publicado:	2026
Materias:	Computational Complexity Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Intrinsic Information Flow in Structureless NP Search
por: Wei, Jing-Yuan
Publicado: (2026)

Information Accessibility Limits in Structured NP Search
por: Wei, Jing-Yuan
Publicado: (2026)

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

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

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

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

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

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)

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

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

On Big-M Reformulations of Bilevel Linear Programs: Hardness of A Posteriori Verification
por: Ketkov, Sergey S., 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)

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

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)

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)

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

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

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)

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)

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)

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

Strassen's support functionals coincide with the quantum functionals
por: Sakabe, Keiya, et al.
Publicado: (2026)

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

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

From Linear to Linearizable Optimization: A Novel Framework with Applications to Stationary and Non-stationary DR-submodular Optimization
por: Pedramfar, Mohammad, et al.
Publicado: (2024)

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

Benign landscape for Burer-Monteiro factorizations of MaxCut-type semidefinite programs
por: Endor, Faniriana Rakoto, et al.
Publicado: (2024)

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

The Computational Complexity of Finding Stationary Points in Non-Convex Optimization
por: Hollender, Alexandros, et al.
Publicado: (2023)

On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization
por: Figueira, José Rui, et al.
Publicado: (2024)