Work

Exponentially improved algorithms and lower bounds for testing signed majorities

Year: 2013

Type: conference-paper

Source: ACM-SIAM Symposium on Discrete Algorithms (SODA)

DOI: 10.1137/1.9781611973105.96

Authors: Dana Ron, Rocco A. Servedio

Institutions: Tel Aviv University, Columbia 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: W2400919826

FWCI: 0.259

Cites:

Cited by: 1

Related to: 10