Information Accessibility Limits in Structured NP Search

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Wei, Jing-Yuan
Format:	Preprint
Published:	2026
Subjects:	Information Theory Computational Complexity Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Submodular Information Selection for Hypothesis Testing with Misclassification Penalties
by: Bhargav, Jayanth, et al.
Published: (2024)

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

Towards Exponential Quantum Improvements in Solving Cardinality-Constrained Binary Optimization
by: Yuan, Haomu, et al.
Published: (2026)

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

On the completeness of several fortification-interdiction games in the Polynomial Hierarchy
by: Tomasaz, Alberto Boggio, et al.
Published: (2024)

Capacity Planning in Stable Matching
by: Bobbio, Federico, et al.
Published: (2021)

Fair Interventions in Weighted Congestion Games
by: Fischer, Miriam, et al.
Published: (2023)

The Complexity of Stackelberg Pricing Games
by: Grüne, Christoph, et al.
Published: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

A degree 4 sum-of-squares lower bound for the clique number of the Paley graph
by: Kunisky, Dmitriy, et al.
Published: (2022)

A proof of P != NP (New symmetric encryption algorithm against any linear attacks and differential attacks)
by: Ming, Gao
Published: (2022)

When Simple is Near Optimal in Security Games
by: Jalota, Devansh, et al.
Published: (2024)

An Information-Theoretic Analysis of Discrete-Time Control and Filtering Limitations by the I-MMSE Relationships
by: Wan, Neng, et al.
Published: (2023)