787 search results - page 5 / 158 » Polynomial Constants are Decidable |
125
click to vote
ALGORITHMICA
2010
14 years 10 months ago
2010
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...
STOC
2002
ACM
16 years 19 hour ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
STOC
2006
ACM
16 years 1 days ago
2006
ACM
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
ISSAC
2004
Springer
15 years 5 months ago
2004
Springer
34
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
