27 search results - page 1 / 6 » coco 2004 |
COCO
2004
Springer
13 years 10 months ago
2004
Springer
COCO
2004
Springer
13 years 10 months ago
2004
Springer
We give a deterministic polynomial time algorithm for polynomial identity testing in the following two cases:
COCO
2004
Springer
13 years 10 months ago
2004
Springer
A source is compressible if we can efficiently compute short descriptions of strings in the support and efficiently recover the strings from the descriptions. A source has high ps...
COCO
2004
Springer
13 years 10 months ago
2004
Springer
We consider the problem of testing bipartiteness in the adjacency matrix model. The best known algorithm, due to Alon and Krivelevich, distinguishes between bipartite graphs and g...
COCO
2004
Springer
13 years 8 months ago
2004
Springer
We study the compression of polynomially samplable sources. In particular, we give efficient prefix-free compression and decompression algorithms for three classes of such sources ...