The following pages link to How easy is local search? (Q1109573):
Displaying 50 items.
- Local search algorithms for political districting (Q2482812) (← links)
- Generalized \(k\)-multiway cut problems (Q2504075) (← links)
- Order preserving reductions and polynomial improving paths (Q2583701) (← links)
- Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions (Q2657274) (← links)
- Typical forcings, NP search problems and an extension of a theorem of Riis (Q2659102) (← links)
- Pure Nash equilibria in a generalization of congestion games allowing resource failures (Q2670923) (← links)
- The complexity of searching implicit graphs (Q2676567) (← links)
- Total functions in QMA (Q2684235) (← links)
- Can local optimality be used for efficient data reduction? (Q2692734) (← links)
- Naturalism, tractability and the adaptive toolbox (Q2695383) (← links)
- On the complexity of local search in unconstrained quadratic binary optimization (Q2810549) (← links)
- On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming (Q2971619) (← links)
- Many-one reductions and the category of multivalued functions (Q2973252) (← links)
- Settling the Complexity of Local Max-Cut (Almost) Completely (Q3012803) (← links)
- Computing Stable Outcomes in Hedonic Games (Q3162517) (← links)
- Integer Programming: Optimization and Evaluation Are Equivalent (Q3183481) (← links)
- A mini–max spanning forest approach to the political districting problem (Q3183734) (← links)
- Linearizing Genomes: Exact Methods and Local Search (Q3297780) (← links)
- Hierarchical Network Formation Games (Q3303895) (← links)
- How long does it take for all users in a social network to choose their communities? (Q3305724) (← links)
- Approximately Counting Locally-Optimal Structures (Q3448823) (← links)
- Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions (Q3460781) (← links)
- Weighted Boolean Formula Games (Q3464467) (← links)
- A CSP-Based Approach for Solving Parity Game (Q3507327) (← links)
- Santa Claus Meets Hypergraph Matchings (Q3541783) (← links)
- POLYNOMIAL LOCAL SEARCH IN THE POLYNOMIAL HIERARCHY AND WITNESSING IN FRAGMENTS OF BOUNDED ARITHMETIC (Q3583040) (← links)
- The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT (Q3637173) (← links)
- A Characterisation of Definable NP Search Problems in Peano Arithmetic (Q3638270) (← links)
- The analysis of local search problems and their heuristics (Q3975934) (← links)
- The effectiveness of finite improvement algorithms for finding global optima (Q4201810) (← links)
- (Q4553289) (← links)
- NP-completeness: A retrospective (Q4571936) (← links)
- The Journey from NP to TFNP Hardness (Q4638115) (← links)
- INCOMPLETENESS IN THE FINITE DOMAIN (Q4640304) (← links)
- The complexity of searching succinctly represented graphs (Q4645179) (← links)
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results (Q4819851) (← links)
- Dynamics of Profit-Sharing Games (Q4985773) (← links)
- Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition (Q5002702) (← links)
- ARRIVAL: Next Stop in CLS (Q5002737) (← links)
- Approximate counting and NP search problems (Q5055313) (← links)
- Global strategies for augmenting the efficiency of TSP heuristics (Q5060118) (← links)
- Adventures in monotone complexity and TFNP (Q5090415) (← links)
- Unique End of Potential Line (Q5091211) (← links)
- (Q5092469) (← links)
- On the complexity of incremental computation (Q5096828) (← links)
- Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games (Q5108232) (← links)
- (Q5111251) (← links)
- Improving TSP Tours Using Dynamic Programming over Tree Decompositions. (Q5111717) (← links)
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds (Q5138782) (← links)
- Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search (Q5139600) (← links)
