The following pages link to NP-hardness
External toolsShowing 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- ALL (complexity) (links | edit)
- BPL (complexity) (links | edit)
- SC (complexity) (links | edit)
- Lattice problem (links | edit)
- Quadratic unconstrained binary optimization (links | edit)
- NP-HARD (redirect page) (links | edit)
- NP-hard problems (redirect page) (links | edit)
- NP-completeness (links | edit)
- Differential privacy (links | edit)
- QMA (links | edit)
- NP-Hard (redirect page) (links | edit)
- Auction (links | edit)
- Directional antenna (links | edit)
- Hilbert's seventeenth problem (links | edit)
- DIMACS (links | edit)
- Bidding (links | edit)
- Metric k-center (links | edit)
- Matrix completion (links | edit)
- Talk:Complexity theory (links | edit)
- Talk:Four color theorem/Archive 3 (links | edit)
- User:LC~enwiki (links | edit)
- User:Esther1888/Heuristic (computer science) (links | edit)
- User:LinguisticMystic/math/10k (links | edit)
- Misplaced Pages:Reference desk/Archives/Computing/2015 February 14 (links | edit)
- Clique percolation method (links | edit)
- Metric k-center (links | edit)
- QIP (complexity) (links | edit)
- TC (complexity) (links | edit)
- Post-quantum cryptography (links | edit)
- Exact quantum polynomial time (links | edit)
- LH (complexity) (links | edit)
- Contraction hierarchies (links | edit)
- Dodgson's method (links | edit)
- Kronecker coefficient (links | edit)
- MaxDDBS (links | edit)
- Tile-matching video game (links | edit)
- Circuit satisfiability problem (links | edit)
- Travelling Salesman (2012 film) (links | edit)
- Boolean hierarchy (links | edit)
- CC (complexity) (links | edit)
- Point-set registration (links | edit)
- Symbolic regression (links | edit)
- Probabilistic soft logic (links | edit)
- NP-hard (redirect page) (links | edit)
- AI-complete (links | edit)
- Boolean satisfiability problem (links | edit)
- P versus NP problem (links | edit)
- Computational complexity theory (links | edit)
- Gaussian elimination (links | edit)
- NP (complexity) (links | edit)
- Quantum computing (links | edit)
- Quantum entanglement (links | edit)
- Regular language (links | edit)
- Tetris (links | edit)
- Travelling salesman problem (links | edit)
- The Art of Computer Programming (links | edit)
- Quadratic programming (links | edit)
- Minimum spanning tree (links | edit)
- Linear programming (links | edit)
- Golomb ruler (links | edit)
- Monotonic function (links | edit)
- Boolean ring (links | edit)
- NP-equivalent (links | edit)
- Genomics (links | edit)
- Load balancing (computing) (links | edit)
- Lemmings (video game) (links | edit)
- Conjunctive normal form (links | edit)
- Sequence alignment (links | edit)
- Phylogenetic tree (links | edit)
- Polynomial-time reduction (links | edit)
- Bayesian network (links | edit)
- Directed acyclic graph (links | edit)
- Combinatorial search (links | edit)
- Computer Go (links | edit)
- Longest common subsequence (links | edit)
- Operator norm (links | edit)
- Cycle space (links | edit)
- Bin packing problem (links | edit)
- Quine–McCluskey algorithm (links | edit)
- Game complexity (links | edit)
- Automatic label placement (links | edit)
- NP (links | edit)
- One-way function (links | edit)
- Tabu search (links | edit)
- Integer programming (links | edit)
- Bottleneck traveling salesman problem (links | edit)
- Graph coloring (links | edit)
- 15 puzzle (links | edit)
- Branch and bound (links | edit)
- Pancake sorting (links | edit)
- 2-satisfiability (links | edit)
- Steiner tree problem (links | edit)
- Complexity class (links | edit)
- Santa Fe Institute (links | edit)
- Independent set (graph theory) (links | edit)
- Extremal graph theory (links | edit)
- Vertex cover (links | edit)
- Binary decision diagram (links | edit)
- Matching (graph theory) (links | edit)
- Parameterized complexity (links | edit)
- XSL attack (links | edit)
- FNP (complexity) (links | edit)
- List of complexity classes (links | edit)
- Polynomial-time approximation scheme (links | edit)
- Cluster analysis (links | edit)
- Perfect graph (links | edit)
- Edge coloring (links | edit)
- Complete coloring (links | edit)
- Fractional coloring (links | edit)
- List of terms relating to algorithms and data structures (links | edit)
- McEliece cryptosystem (links | edit)
- Meyniel graph (links | edit)
- Bounding sphere (links | edit)
- Belief propagation (links | edit)
- Cutting stock problem (links | edit)
- Set cover problem (links | edit)
- Topological sorting (links | edit)
- Cubic graph (links | edit)
- Euclidean minimum spanning tree (links | edit)
- Point-set triangulation (links | edit)
- Maximum parsimony (phylogenetics) (links | edit)
- Logic in computer science (links | edit)
- K-minimum spanning tree (links | edit)
- Complete (complexity) (links | edit)
- Edward G. Coffman Jr. (links | edit)
- Art gallery problem (links | edit)
- Band matrix (links | edit)
- Empirical risk minimization (links | edit)
- Chromatic polynomial (links | edit)
- Promise problem (links | edit)
- Circuit rank (links | edit)
- Protein design (links | edit)
- Game of the Amazons (links | edit)
- Quadratic assignment problem (links | edit)
- Hadwiger number (links | edit)
- Convex optimization (links | edit)
- Metric dimension (graph theory) (links | edit)
- Job shop (links | edit)
- Dominating set (links | edit)
- Domatic number (links | edit)
- Feedback arc set (links | edit)
- K-means clustering (links | edit)
- Szemerédi regularity lemma (links | edit)
- Path cover (links | edit)
- No-three-in-line problem (links | edit)
- Coin problem (links | edit)
- Answer set programming (links | edit)
- Signed graph (links | edit)
- SystemVerilog (links | edit)
- Minimum degree spanning tree (links | edit)
- Shortest common supersequence (links | edit)
- Separable state (links | edit)
- Computer-assisted proof (links | edit)
- List of combinatorial computational geometry topics (links | edit)
- Blocks world (links | edit)
- Watchman route problem (links | edit)
- Unique games conjecture (links | edit)
- PCP theorem (links | edit)
- Economic lot scheduling problem (links | edit)
- Linear network coding (links | edit)
- Threading (protein sequence) (links | edit)
- Pseudo-polynomial time (links | edit)
- MAX-3LIN-EQN (links | edit)
- MAX-3SAT (links | edit)
- Partition problem (links | edit)
- Maximum satisfiability problem (links | edit)
- Functional verification (links | edit)
- Unit disk graph (links | edit)
- Transitive reduction (links | edit)
- Tree alignment (links | edit)
- Computational phylogenetics (links | edit)
- Treewidth (links | edit)
- Book embedding (links | edit)
- Maximum common induced subgraph (links | edit)
- Edge cover (links | edit)
- Computational problem (links | edit)
- Lattice reduction (links | edit)
- Postage stamp problem (links | edit)
- God's algorithm (links | edit)
- Pathwidth (links | edit)
- Grundy number (links | edit)
- Kemeny–Young method (links | edit)
- Strong NP-completeness (links | edit)
- Linear programming relaxation (links | edit)
- Ancestral reconstruction (links | edit)
- Employee scheduling software (links | edit)
- Discrete tomography (links | edit)
- Unit distance graph (links | edit)
- Combinatorial auction (links | edit)
- Parity game (links | edit)
- Vehicle routing problem (links | edit)
- Continuous knapsack problem (links | edit)
- Weak NP-completeness (links | edit)
- Euclidean distance matrix (links | edit)
- Modified due-date scheduling heuristic (links | edit)
- Graph embedding (links | edit)
- Join five (links | edit)
- Generalized assignment problem (links | edit)
- Quadratically constrained quadratic program (links | edit)
- Cactus graph (links | edit)
- Hamiltonian completion (links | edit)
- Multi-objective optimization (links | edit)
- Optimal facility location (links | edit)
- Drools (links | edit)
- Euclidean shortest path (links | edit)
- Addition-subtraction chain (links | edit)
- Hydrophobic-polar protein folding model (links | edit)
- Issues affecting the single transferable vote (links | edit)
- Interval order (links | edit)
- Geometric spanner (links | edit)
- Graph partition (links | edit)
- Unary language (links | edit)
- Sparse language (links | edit)
- Conjunctive query (links | edit)
- Shifting bottleneck heuristic (links | edit)
- Genetic algorithm scheduling (links | edit)
- Arc routing (links | edit)
- Heuristic (computer science) (links | edit)
- Kawasaki's theorem (links | edit)
- Kernelization (links | edit)
- Segmentation-based object categorization (links | edit)
- Mihalis Yannakakis (links | edit)
- Floorplan (microelectronics) (links | edit)
- Charging argument (links | edit)
- Parallel metaheuristic (links | edit)
- Shmuel Safra (links | edit)
- Job-shop scheduling (links | edit)
- Routing in delay-tolerant networking (links | edit)
- Clique-width (links | edit)
- Clique cover (links | edit)
- Distance-hereditary graph (links | edit)
- Numerical sign problem (links | edit)
- Smoothed analysis (links | edit)
- Crossing number (graph theory) (links | edit)
- Sparse PCA (links | edit)
- Unbalanced oil and vinegar scheme (links | edit)
- Lattice problem (links | edit)
- Longest path problem (links | edit)
- Tensor rank decomposition (links | edit)
- Planar separator theorem (links | edit)
- Spark (mathematics) (links | edit)
- Maximum cut (links | edit)
- Interval finite element (links | edit)
- Steinitz's theorem (links | edit)
- Closest string (links | edit)
- Graph canonization (links | edit)
- Rigid origami (links | edit)
- Hardness of approximation (links | edit)
- Vertex cycle cover (links | edit)
- Star coloring (links | edit)
- Greedy coloring (links | edit)
- Set TSP problem (links | edit)
- Edge dominating set (links | edit)
- Constraint composite graph (links | edit)
- Minimum-weight triangulation (links | edit)
- 3-dimensional matching (links | edit)
- K-means++ (links | edit)
- Carsten Lund (links | edit)
- Referring expression generation (links | edit)
- MAXEkSAT (links | edit)
- Richard D. Braatz (links | edit)
- Capacitated minimum spanning tree (links | edit)
- Matroid intersection (links | edit)
- NP-completeness (links | edit)
- QMA (links | edit)
- Quantum complexity theory (links | edit)
- Maximum coverage problem (links | edit)
- Cycle basis (links | edit)
- David Shmoys (links | edit)
- Leontief utilities (links | edit)
- Joint spectral radius (links | edit)
- Quasi-polynomial time (links | edit)
- David Mount (links | edit)
- Metric k-center (links | edit)
- Elliptic curve only hash (links | edit)
- Matchstick graph (links | edit)
- Succinct game (links | edit)
- Map folding (links | edit)
- Post-quantum cryptography (links | edit)
- Protein fragment library (links | edit)
- Quadratic bottleneck assignment problem (links | edit)
- Graph bandwidth (links | edit)
- Rectilinear Steiner tree (links | edit)
- Crystallographic image processing (links | edit)
- Hybrid genome assembly (links | edit)
- Apex graph (links | edit)
- Bejeweled (series) (links | edit)
- Existential theory of the reals (links | edit)
- Pseudo-Boolean function (links | edit)
- Intersection number (graph theory) (links | edit)
- Partial k-tree (links | edit)
- Minimum routing cost spanning tree (links | edit)
- Open-shop scheduling (links | edit)
- FORR (links | edit)
- List update problem (links | edit)
- Dissociation number (links | edit)
- Dense subgraph (links | edit)
- Hindley–Milner type system (links | edit)
- Layered graph drawing (links | edit)
- Submodular set function (links | edit)
- Video coding format (links | edit)
- Traveling purchaser problem (links | edit)
- Probability bounds analysis (links | edit)
- Matrix completion (links | edit)
- Immanuel Bomze (links | edit)
- Linear arboricity (links | edit)
- Disjunctive graph (links | edit)
- Graph power (links | edit)
- Feature learning (links | edit)
- Arc diagram (links | edit)
- Catherine McGeoch (links | edit)
- Dimension (graph theory) (links | edit)
- Shannon capacity of a graph (links | edit)
- Blake canonical form (links | edit)
- Ecological rationality (links | edit)
- Distributed file system for cloud (links | edit)
- Teiresias algorithm (links | edit)
- K-anonymity (links | edit)
- Nurse scheduling problem (links | edit)
- Polygon covering (links | edit)
- Thickness (graph theory) (links | edit)
- RAC drawing (links | edit)
- Planarization (links | edit)
- Vehicle rescheduling problem (links | edit)
- Barrier resilience (links | edit)
- Computational heuristic intelligence (links | edit)
- Approximate max-flow min-cut theorem (links | edit)
- Max/min CSP/Ones classification theorems (links | edit)
- Loss functions for classification (links | edit)
- Ring learning with errors (links | edit)
- Wiener connector (links | edit)
- Inferring horizontal gene transfer (links | edit)
- Mahaney's theorem (links | edit)
- Distinguishing coloring (links | edit)
- Matroid girth (links | edit)
- Giorgio Ausiello (links | edit)
- Simultaneous embedding (links | edit)
- Skolem problem (links | edit)
- Polygon partition (links | edit)
- Utilitarian cake-cutting (links | edit)
- Vickrey–Clarke–Groves mechanism (links | edit)
- Frankl–Rödl graph (links | edit)
- Tardiness (scheduling) (links | edit)
- Glossary of artificial intelligence (links | edit)
- Bucket queue (links | edit)
- Parallel redrawing (links | edit)
- Quadratic knapsack problem (links | edit)
- Quantum optimization algorithms (links | edit)
- Stefan Szeider (links | edit)
- Penny graph (links | edit)
- Tardos function (links | edit)
- Matroid parity problem (links | edit)
- Sum coloring (links | edit)
- Odd cycle transversal (links | edit)
- Tropical cryptography (links | edit)
- Alison Harcourt (links | edit)
- Micah Altman (links | edit)
- Graph cut optimization (links | edit)
- Quadratic pseudo-Boolean optimization (links | edit)
- Induced matching (links | edit)
- Pinwheel scheduling (links | edit)
- Dasgupta's objective (links | edit)
- Topswops (links | edit)
- Lattice of stable matchings (links | edit)
- Reconfiguration (links | edit)
- In Pursuit of the Traveling Salesman (links | edit)
- Efficient approximately fair item allocation (links | edit)
- Minimum evolution (links | edit)
- Polygonalization (links | edit)
- Berlekamp switching game (links | edit)
- Graham–Pollak theorem (links | edit)
- Birkhoff algorithm (links | edit)
- Egalitarian item allocation (links | edit)
- Grid bracing (links | edit)
- Graph neural network (links | edit)
- Stacker crane problem (links | edit)
- Fair division among groups (links | edit)
- Rank-width (links | edit)
- High-multiplicity bin packing (links | edit)
- Recursive largest first algorithm (links | edit)
- Cutwidth (links | edit)
- Multidimensional assignment problem (links | edit)
- Twin-width (links | edit)
- Dijoin (links | edit)
- Welfare maximization (links | edit)
- Optimal kidney exchange (links | edit)
- Small set expansion hypothesis (links | edit)
- Fractional job scheduling (links | edit)
- Carving width (links | edit)
- Weisfeiler Leman graph isomorphism test (links | edit)
- Flip distance (links | edit)
- Thiele's voting rules (links | edit)
- Optimal network design (links | edit)
- Talk:NP-hardness (links | edit)
- Talk:NP-completeness (links | edit)
- Talk:Protein structure prediction (links | edit)
- Talk:Clique problem (links | edit)
- Talk:Graph coloring (links | edit)
- Talk:Automatic differentiation (links | edit)
- Talk:Cutting stock problem (links | edit)
- Talk:Convex optimization (links | edit)
- Talk:Finitary relation/Archive 1 (links | edit)
- Talk:K-means clustering (links | edit)
- Talk:Obfuscating software (links | edit)
- Talk:Kemeny–Young method (links | edit)
- Talk:Free will/Archive 3 (links | edit)
- Talk:Cobham's thesis (links | edit)
- Talk:Uniform-machines scheduling (links | edit)
- Talk:Coin problem (links | edit)
- Talk:Job-shop scheduling (links | edit)
- Talk:Expelled: No Intelligence Allowed/Archive 13 (links | edit)
- Talk:Peano curve (links | edit)
- Talk:Bellman–Ford algorithm/Archive 1 (links | edit)
- Talk:NP-hard (transclusion) (links | edit)
- Talk:Nash equilibrium/Archive 1 (links | edit)
- Talk:Directed acyclic graph/Archive 1 (links | edit)
- Talk:Single transferable vote/Archive 2 (links | edit)
- Talk:Travelling salesman problem/Archive 2 (links | edit)
- Talk:Candy Crush Saga/Archive 1 (links | edit)
- User:LC~enwiki (links | edit)
- User:Matt Crypto/Simplified Cryptography (links | edit)
- User:Daverobe/MAX-3SAT (links | edit)
- User:EdK (links | edit)
- User:Bengl/3804 Related Articles (links | edit)
- User:Niubrad (links | edit)
- User:Mathbot/Most linked math articles (links | edit)
- User:Aene (links | edit)
- User:Salix alba/One day of mathematics page views (links | edit)
- User:Tcshasaposse/Computational complexity theory (links | edit)
- User:SelectionBot/0.7/C-8 (links | edit)
- User:Benhoman/Sandbox (links | edit)
- User:PeregrinoGris/Búsqueda tabú (links | edit)
- User:Thore Husfeldt/sandbox (links | edit)
- User:Thewayiseeit/k-means++ (links | edit)
- User:Thore Husfeldt/Path Algorithms (links | edit)
- User:Reo On/Books/statistics for tree construction (links | edit)
- User:Jim.belk/Most viewed math articles (2010) (links | edit)
- User:Konetidy/Books/Computational Complexity (links | edit)
- User:Phoe6/Books/Algorithms (links | edit)
- User:Xionbox/Algorithms (links | edit)
- User:Greg4cr/Tabu search (links | edit)
- User:Nviladkar/Books/TOC (links | edit)
- User:Sigma0 1/ma (links | edit)
- User:Mutsch/sandbox (links | edit)
- User:Mutsch (links | edit)
- User:Bmears11/mysandbox/Integer Linear Programming (links | edit)
- User:Legobot/Wikidata/General (links | edit)
- User:Pablo.gainza/sandbox (links | edit)
- User:Mitutitu2012/sandbox (links | edit)
- User:Mitutitu2012/Draft of the page for Kcut spectral algorithm (links | edit)
- User:Tompw/Books/Mathematics (links | edit)
- User:Tompw/Books/Mathematics (N) (links | edit)
- User:Oligenom/Books/Cluster Research2 (links | edit)
- User:Ajoyz/Books/Solid (links | edit)
- User:Rkrish67/Books/Design Analysis Algorithms (links | edit)
- User:Krit-tonkla/sandbox (links | edit)
- User:Artisticidea/Books/Graph Theory (links | edit)
- User:ChiaMonkey/Books/cstopics (links | edit)
- User:Milanambiar/sandbox (links | edit)
- User:Wanghe07/sandbox (links | edit)
- User:PhoenixOfBagels/Books/Coding Interview Materials (links | edit)
- User:TonyWang0316/sandbox (links | edit)
- User:Jangradeepak/Books/DNA COMPUTING (links | edit)
- User:Williamdemeo/Books/Complexity Theory (links | edit)
- User:Niubrad/BradsRabbitHole (links | edit)
- User:Niubrad/Books/Sandbox (links | edit)
- User:Niubrad/Books/BradsBook (links | edit)
- User:Ntheazk/sandbox (links | edit)
- User:Niubrad/Books/BradleysBook (links | edit)
- User:Neha.1687/Books/Decidability (links | edit)
- User:Niubrad/Books/BradleysBookSave (links | edit)
- User:Xxfooln/Books/Complexity Heirarchy (links | edit)
- User:Lady-shirakawa/sandbox (links | edit)
- User:Williamdemeo/Books/Complexity, Computability, and Types (links | edit)
- User:Esther1888/Heuristic (computer science) (links | edit)
- User:Shuiberts/sandbox (links | edit)
- User:Cycrax/sandbox (links | edit)
- User:Surjray/sandbox comp phylo (links | edit)
- User:Jaydavidmartin/Complexity class (links | edit)
- User:Stellaathena/sandbox (links | edit)
- User:Wooryans/sandbox (links | edit)
- User:Amyrmahdy/sandbox (links | edit)
- User:HusseinHoudrouge/sandbox (links | edit)
- User:NickDiCicco/sandbox (links | edit)
- User:GaseousButter/sandbox (links | edit)
- User:To stats or not to stats/SPCA sandbox (links | edit)
- User talk:LizardWizard (links | edit)
- User talk:Dmaciej (links | edit)
- User talk:Notuncurious/Archive 2 (links | edit)
- User talk:Kevin Baas/Archive8 (links | edit)
- Misplaced Pages:Misplaced Pages as a conference paper source (links | edit)
- Misplaced Pages:Reference desk/Archives/Mathematics/April 2006 (links | edit)
- Misplaced Pages:Reference desk/Archives/Mathematics/2006 July 10 (links | edit)
- Misplaced Pages:Reference desk/Archives/Mathematics/2006 September 5 (links | edit)
- Misplaced Pages:Articles for creation/2007-10-15 (links | edit)
- Misplaced Pages:WikiProject Mathematics/Assessment/Frequently viewed/List (links | edit)
- Misplaced Pages:Reference desk/Archives/Mathematics/2008 August 6 (links | edit)
- Misplaced Pages:0.7/0.7index/Computing (links | edit)
- Misplaced Pages:0.7/0.7alpha/N1 (links | edit)
- Misplaced Pages:Reference desk/Archives/Mathematics/2010 January 5 (links | edit)
- Misplaced Pages:Reference desk/Archives/Mathematics/2010 March 6 (links | edit)
- Misplaced Pages:No original research/Noticeboard/Archive 12 (links | edit)
- Misplaced Pages:Village pump (technical)/Archive 76 (links | edit)
- Misplaced Pages:Reference desk/Archives/Mathematics/2014 January 21 (links | edit)
- Misplaced Pages:Reference desk/Archives/Science/2014 May 19 (links | edit)
- Misplaced Pages:Reference desk/Archives/Computing/2015 February 14 (links | edit)
- Misplaced Pages:Reference desk/Archives/Science/2015 February 17 (links | edit)
- Misplaced Pages:Reference desk/Archives/Science/2015 May 25 (links | edit)
- Misplaced Pages:Law of hats (links | edit)
- Misplaced Pages:Reference desk/Archives/Mathematics/2020 March 2 (links | edit)
- Misplaced Pages:Reference desk/Archives/Mathematics/2021 September 17 (links | edit)
- Misplaced Pages:Misplaced Pages Signpost/2023-04-26/Humour (links | edit)
- Misplaced Pages:Misplaced Pages Signpost/Single/2023-04-26 (links | edit)
- Draft:Knut Reinert (links | edit)
- Exact algorithm (links | edit)
- PL (complexity) (links | edit)
- Geometric set cover problem (links | edit)
- Nullspace property (links | edit)
- Glossary of artificial intelligence (links | edit)
- Multiplicative weight update method (links | edit)
- Genome architecture mapping (links | edit)
- List of unsolved problems in fair division (links | edit)
- Multi-agent pathfinding (links | edit)
- Ailsa Land (links | edit)
- Minimum relevant variables in linear system (links | edit)
- Science Fell in Love, So I Tried to Prove It (links | edit)
- Planar SAT (links | edit)
- Assembly line feeding problem (links | edit)
- Stochastic transitivity (links | edit)
- MRF optimization via dual decomposition (links | edit)
- Spaced seed (links | edit)
- Daniel J. Hulme (links | edit)
- Multiway number partitioning (links | edit)