Work

P = BPP if E requires exponential circuits: derandomizing the XOR lemma

Year: 1997

Type: conference-paper

Source: ACM Symposium on Theory of Computing (STOC)

DOI: 10.1145/258533.258590

Authors: Russell Impagliazzo, Avi Wigderson

Institutions: University of California San Diego, Hebrew University of Jerusalem

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: W2021736779

FWCI: 9.608

Cites: 24

Cited by: 590

Related to: 10