Work

Derandomizing polynomial identity tests means proving circuit lower bounds

Year: 2003

Type: conference-paper

DOI: 10.1145/780591.780595

Authors: Valentine Kabanets, Russell Impagliazzo

Institutions: Simon Fraser University, University of California San Diego

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W247221977

FWCI: 0.964

Cites:

Cited by: 42

Related to: 10