40 search results - page 8 / 8 » focs 1999 |
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
FOCS
2000
IEEE
13 years 9 months ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
COSIT
1999
Springer
13 years 9 months ago
1999
Springer
Cur rent ont ologi es' upp er-le vel tax onomi c str uctur e is oft en qui te com plica ted and hard to und ersta nd. In thi s pap er I sho w how the the oret ical too ls of ...