DocumentCode

1632356

Title

Algorithmic derandomization via complexity theory

Author

Sivakumar, D.

Author_Institution

IBM Almaden Research Center

fYear

2002

fDate

6/24/1905 12:00:00 AM

Firstpage

6

Lastpage

6

Keywords

Complexity theory; Computational complexity; Linear programming; Parallel programming; Polynomials; Web pages;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Complexity, 2002. Proceedings. 17th IEEE Annual Conference on

ISSN

1093-0159

Print_ISBN

0-7695-1468-5

Type

conf

DOI

10.1109/CCC.2002.1004325

Filename

1004325