Misplaced Pages

The following pages link to NP-hardness

• (link count
• transclusion count
• sorted list) · See help page for transcluding these entries

Showing 50 items.

• BPP (complexity) (links | edit)
• BQP (links | edit)
• Compiler (links | edit)
• Computational chemistry (links | edit)
• P versus NP problem (links | edit)
• Co-NP (links | edit)
• Computational complexity theory (links | edit)
• Hash table (links | edit)
• NP (complexity) (links | edit)
• NC (complexity) (links | edit)
• ♯P (links | edit)
• ♯P-complete (links | edit)
• Travelling salesman problem (links | edit)
• Knight's tour (links | edit)
• PSPACE (links | edit)
• Reductionism (links | edit)
• Sokoban (links | edit)
• Co-NP-complete (links | edit)
• P-complete (links | edit)
• PSPACE-complete (links | edit)
• EXPTIME (links | edit)
• EXPSPACE (links | edit)
• RP (complexity) (links | edit)
• ZPP (complexity) (links | edit)
• System on a chip (links | edit)
• Interactive proof system (links | edit)
• Formal methods (links | edit)
• Chinese postman problem (links | edit)
• Cryptographically secure pseudorandom number generator (links | edit)
• Arithmetical hierarchy (links | edit)
• Bayesian network (links | edit)
• Medium access control (links | edit)
• Tensor (intrinsic definition) (links | edit)
• Bin packing problem (links | edit)
• UP (complexity) (links | edit)
• Game complexity (links | edit)
• Simplex algorithm (links | edit)
• NP hard (redirect page) (links | edit)
  • Pumping lemma for regular languages (links | edit)
  • Guillotine cutting (links | edit)
  • Constrained optimization (links | edit)
  • Supnick matrix (links | edit)
  • Interval chromatic number of an ordered graph (links | edit)
  • Quadratic unconstrained binary optimization (links | edit)
  • Pebble motion problems (links | edit)
  • Alias method (links | edit)
  • Talk:Alias method (links | edit)
  • User:MWinter4/Edge graph of a polytope (links | edit)
  • Misplaced Pages:Reference desk/Archives/Computing/2016 May 5 (links | edit)
• Random oracle (links | edit)
• Steiner tree problem (links | edit)
• Complexity class (links | edit)
• Probabilistically checkable proof (links | edit)
• Approximation algorithm (links | edit)
• NSPACE (links | edit)
• DSPACE (links | edit)
• DTIME (links | edit)
• NTIME (links | edit)
• P (complexity) (links | edit)
• PH (complexity) (links | edit)
• Polynomial hierarchy (links | edit)