Work

Probabilistic Polynomials and Hamming Nearest Neighbors (Full Version)

Year: 2015

Type: article

Authors: Josh Alman, Ryan Williams

Institution: Stanford University

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

FWCI:

Cites: 33

Cited by:

Related to: 10