Pages that link to "APX"
From HandWiki
← APX
The following pages link to APX:
Displayed 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Arthur–Merlin protocol (← links)
- Computational complexity theory (← links)
- Graph edit distance (← links)
- IP (complexity) (← links)
- NP-completeness (← links)
- Probabilistically checkable proof (← links)
- Wiener connector (← links)
- Approximation algorithm (← links)
- DSPACE (← links)
- DTIME (← links)
- Exact algorithm (← links)
- Interactive proof system (← links)
- NSPACE (← links)
- NTIME (← links)
- Complexity class (← links)
- List of complexity classes (← links)
- P versus NP problem (← links)
- BQP (← links)
- Approximation-preserving reduction (← links)
- Feedback arc set (← links)
- Polynomial-time approximation scheme (← links)
- PTAS reduction (← links)
- Token reconfiguration (← links)
- Arithmetical hierarchy (← links)
- ELEMENTARY (← links)
- Grzegorczyk hierarchy (← links)
- Boolean hierarchy (← links)
- Polynomial hierarchy (← links)
- Boolean satisfiability problem (← links)
- Computable function (← links)
- Dominating set (← links)
- Vertex cycle cover (← links)
- MaxDDBS (← links)
- Feedback vertex set (← links)
- Maximum satisfiability problem (← links)
- Vertex cover (← links)
- Travelling salesman problem (← links)
- Pebble motion problems (← links)
- Canadian traveller problem (← links)
- Independent set (graph theory) (← links)
- Cubic graph (← links)
- NP (complexity) (← links)
- NL (complexity) (← links)
- PSPACE-complete (← links)
- Parity P (← links)
- 2-EXPTIME (← links)
- NP-hardness (← links)
- QIP (complexity) (← links)
- BPL (complexity) (← links)
- BPP (complexity) (← links)
