Work

Hardness vs randomness

Year: 1994

Type: article

Source: Journal of Computer and System Sciences

DOI: 10.1016/s0022-0000(05)80043-1

Authors: Noam Nisan, Avi Wigderson

Institution: 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: bronze

Funders: National Science Foundation, Israel Academy of Sciences and Humanities

Awards: Research on the Relative Power of Randomizing and Deterministic Algorithmns, G7834923397

OpenAlex ID: W1998918799

FWCI: 9.076

Cites: 25

Cited by: 859

Related to: 10