757 search results - page 18 / 152 » On the hardness of approximating Max-Satisfy |
COMPGEOM
2007
ACM
15 years 3 months ago
2007
ACM
ESA
2004
Springer
15 years 3 months ago
2004
Springer
102
click to vote
FOCS
1992
IEEE
15 years 3 months ago
1992
IEEE
The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of ...
96
Voted
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
CPM
2008
Springer
15 years 1 months ago
2008
Springer