The following pages link to How easy is local search? (Q1109573):
Displaying 50 items.
- The complexity of counting locally maximal satisfying assignments of Boolean CSPs (Q284575) (← links)
- Approximately counting locally-optimal structures (Q295655) (← links)
- Computing pure Nash and strong equilibria in bottleneck congestion games (Q378094) (← links)
- Propositional proofs and reductions between NP search problems (Q435190) (← links)
- Local search: is brute-force avoidable? (Q439931) (← links)
- Convergence and approximation in potential games (Q441854) (← links)
- On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities (Q456174) (← links)
- Recent development in computational complexity characterization of Nash equilibrium (Q458453) (← links)
- Equilibria, fixed points, and complexity classes (Q458480) (← links)
- Exponentiality of the exchange algorithm for finding another room-partitioning (Q496707) (← links)
- Did the train reach its destination: the complexity of finding a witness (Q509884) (← links)
- Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games (Q524372) (← links)
- Nested PLS (Q535153) (← links)
- Convergence to approximate Nash equilibria in congestion games (Q632952) (← links)
- On the computational complexity of cut-reduction (Q636310) (← links)
- The provably total NP search problems of weak second order bounded arithmetic (Q639650) (← links)
- Performance of one-round walks in linear congestion games (Q647486) (← links)
- On best response dynamics in weighted congestion games with polynomial delays (Q661067) (← links)
- Local search, reducibility and approximability of NP-optimization problems (Q673464) (← links)
- A note on the complexity of local search problems (Q673814) (← links)
- On existence theorems (Q686508) (← links)
- Open questions in complexity theory for numerical optimization (Q687097) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Alternating minima and maxima, Nash equilibria and bounded arithmetic (Q764279) (← links)
- On total functions, existence theorems and computational complexity (Q808245) (← links)
- On the quantum query complexity of local search in two and three dimensions (Q835649) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Analyzing the complexity of finding good neighborhood functions for local search algorithms (Q857808) (← links)
- On the complexity of finding falsifying assignments for Herbrand disjunctions (Q892133) (← links)
- Minimizing expectation plus variance (Q904686) (← links)
- The capacitated max \(k\)-cut problem (Q930343) (← links)
- Symmetries and the complexity of pure Nash equilibrium (Q1004282) (← links)
- Pure Nash equilibria in player-specific and weighted congestion games (Q1014625) (← links)
- Enhanced algorithms for local search (Q1045925) (← links)
- Local minima for indefinite quadratic knapsack problems (Q1186274) (← links)
- Generalizations of Opt P to the polynomial hierarchy (Q1193867) (← links)
- Traveling salesman problem and local search (Q1195657) (← links)
- Complexity of uniqueness and local search in quadratic 0-1 programming (Q1197889) (← links)
- Paroids: A canonical format for combinatorial optimization (Q1199464) (← links)
- Local search and the local structure of NP-complete problems (Q1200797) (← links)
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems (Q1204869) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- The relative complexity of NP search problems (Q1273858) (← links)
- Genetic local search in combinatorial optimization (Q1317048) (← links)
- On the complexity of the parity argument and other inefficient proofs of existence (Q1329155) (← links)
- New local search approximation techniques for maximum generalized satisfiability problems (Q1351586) (← links)
- On the complexity of approximating a KKT point of quadratic programming (Q1380927) (← links)
- On the quality of local search for the quadratic assignment problem (Q1383366) (← links)
- Finding optimal subgraphs by local search (Q1392027) (← links)
- A local search template. (Q1406708) (← links)
