×
+ All Categories
Log in
English
Français
Español
Deutsch
The top documents tagged [polynomial time reduction]
Home >
polynomial time reduction
Algorithm lecture45
90 views
CS 2003 Unsolved
228 views
1 NP-completeness Lecture 2: Jan 11. 2 P The class of problems that can be solved in polynomial time. e.g. gcd, shortest path, prime, etc. There are many.
215 views
On Approximating the Maximum Simple Sharing Problem Danny Chen University of Notre Dame Rudolf Fleischer, Jian Li, Zhiyi Xie, Hong Zhu Fudan University.
215 views
NP-Complete Problems
26 views
CS623: Introduction to Computing with Neural Nets (lecture-7)
25 views
1 How to establish NP-hardness Lemma: If L 1 is NP-hard and L 1 ≤ L 2 then L 2 is NP-hard.
219 views
How to establish NP -hardness
27 views
How to establish NP -hardness
34 views
NP-Complete Problems
23 views
Cs 2003
45 views
NP-Completeness: Reductions CSc 4520/6520 Fall 2013 Slides adapted from David Evans (Virgina) and Costas Busch (RPI)
217 views