Derandomizing polynomial identity tests means proving circuit lower bounds

Valentine Kabanets and Russell Impagliazzo

misc2004

Citation key: KabanetsImpagliazzo2004
Year: 2004
Cited by: 1 catalog records
Direct source: Available

Reference note

Why this source is in the ledger

Valentine Kabanets and Russell Impagliazzo, “Derandomizing polynomial identity tests means proving circuit lower bounds,” Computational Complexity 13 (2004), 1–46, DOI: 10.1007/s00037-004-0182-6.

Catalog connections

Conjectures citing this source

TCS-024Deterministic Polynomial Identity TestingTheoretical computer science

Source record

Bibliographic fields

Inspect the parsed BibTeX fields

author: Valentine Kabanets and Russell Impagliazzo
doi: 10.1007/s00037-004-0182-6
note: Valentine Kabanets and Russell Impagliazzo, “Derandomizing polynomial identity tests means proving circuit lower bounds,” Computational Complexity 13 (2004), 1--46, DOI: 10.1007/s00037-004-0182-6.
title: Derandomizing polynomial identity tests means proving circuit lower bounds
year: 2004