Work

CS369E: Communication Complexity (for Algorithm Designers) Lecture #8: Lower Bounds in Property Testing

Year: 2015

Type: article

Author: Tim Roughgarden

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

FWCI:

Cites: 14

Cited by:

Related to: 10