Pages that link to "Item:Q3204045"
From MaRDI portal
The following pages link to Simple Local Search Problems that are Hard to Solve (Q3204045):
Displaying 50 items.
- Approximately counting locally-optimal structures (Q295655) (← links)
- Convergence and approximation in potential games (Q441854) (← links)
- Equilibria, fixed points, and complexity classes (Q458480) (← links)
- Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games (Q524372) (← links)
- Convergence to approximate Nash equilibria in congestion games (Q632952) (← links)
- A note on the complexity of local search problems (Q673814) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Minimizing expectation plus variance (Q904686) (← links)
- Complexity of local search for the \(p\)-median problem (Q932191) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- Symmetries and the complexity of pure Nash equilibrium (Q1004282) (← links)
- How easy is local search? (Q1109573) (← links)
- Are analog neural networks better than binary neural networks? (Q1126906) (← links)
- Generalizations of Opt P to the polynomial hierarchy (Q1193867) (← links)
- Complexity of uniqueness and local search in quadratic 0-1 programming (Q1197889) (← links)
- Computing with truly asynchronous threshold logic networks (Q1269908) (← links)
- On the quality of local search for the quadratic assignment problem (Q1383366) (← links)
- Finding optimal subgraphs by local search (Q1392027) (← links)
- Complexity of single-swap heuristics for metric facility location and related problems (Q1628593) (← links)
- The complexity of Boolean constraint satisfaction local search problems (Q1777392) (← links)
- On complexity of unconstrained hyperbolic 0--1 programming problems (Q1779713) (← links)
- On local search for the generalized graph coloring problem (Q1870000) (← links)
- Matrix representation and gradient flows for NP-hard problems (Q1906756) (← links)
- A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs (Q1909003) (← links)
- On the \(\mathcal {PLS}\)-complexity of maximum constraint assignment (Q1935800) (← links)
- Computational aspects of the colorful Carathéodory theorem (Q1991350) (← links)
- Timed network games (Q2112796) (← links)
- A variation of DS decomposition in set function optimization (Q2185813) (← links)
- Unique end of potential line (Q2194856) (← links)
- A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint (Q2203598) (← links)
- Patience of matrix games (Q2444536) (← links)
- Continuous dynamical systems that realize discrete optimization on the hypercube (Q2503628) (← links)
- Generalized \(k\)-multiway cut problems (Q2504075) (← links)
- Pure Nash equilibria in a generalization of congestion games allowing resource failures (Q2670923) (← links)
- Pairwise-Interaction Games (Q3012801) (← 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)
- Linearizing Genomes: Exact Methods and Local Search (Q3297780) (← links)
- Approximately Counting Locally-Optimal Structures (Q3448823) (← links)
- Smoothed Analysis of the Squared Euclidean Maximum-Cut Problem (Q3452814) (← links)
- The analysis of local search problems and their heuristics (Q3975934) (← links)
- Approximate algorithms for generalized maximum utility problems (Q4420772) (← links)
- (Q4495202) (← links)
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results (Q4819851) (← links)
- Dynamics of Profit-Sharing Games (Q4985773) (← links)
- Approximation of Constraint Satisfaction via local search (Q5057457) (← links)
- Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games (Q5108232) (← links)
- (Q5111251) (← links)
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds (Q5138782) (← links)
