Volume 31; Issue 6

SIAM Journal on Computing

Volume 31; Issue 6
3

Hardness of Approximate Hypergraph Coloring

Guruswami, Venkatesan, Hastad, Johan, Sudan, Madhu
Journal:
SIAM Journal on Computing
Year:
2002
Language:
english
File:
PDF, 269 KB
english, 2002
4

The Minimization Problem for Boolean Formulas

Hemaspaandra, Edith, Wechsung, Gerd
Journal:
SIAM Journal on Computing
Year:
2002
Language:
english
File:
PDF, 169 KB
english, 2002
6

Are Bitvectors Optimal?

Buhrman, H., Miltersen, P. B., Radhakrishnan, J., Venkatesh, S.
Journal:
SIAM Journal on Computing
Year:
2002
Language:
english
File:
PDF, 263 KB
english, 2002
7

On the Boundary Complexity of the Union of Fat Triangles

Pach, János, Tardos, Gábor
Journal:
SIAM Journal on Computing
Year:
2002
Language:
english
File:
PDF, 197 KB
english, 2002
8

Approximate String Matching: A Simpler Faster Algorithm

Cole, Richard, Hariharan, Ramesh
Journal:
SIAM Journal on Computing
Year:
2002
Language:
english
File:
PDF, 235 KB
english, 2002
10

Maintaining Stream Statistics over Sliding Windows

Datar, Mayur, Gionis, Aristides, Indyk, Piotr, Motwani, Rajeev
Journal:
SIAM Journal on Computing
Year:
2002
Language:
english
File:
PDF, 219 KB
english, 2002
13

Lower Bounds for Lucas Chains

Kutz, Martin
Journal:
SIAM Journal on Computing
Year:
2002
Language:
english
File:
PDF, 172 KB
english, 2002
15

Simple Learning Algorithms for Decision Trees and Multivariate Polynomials

Bshouty, Nader H., Mansour, Yishay
Journal:
SIAM Journal on Computing
Year:
2002
Language:
english
File:
PDF, 229 KB
english, 2002