Work

Amplification and percolation (probabilistic Boolean functions)

Year: 1992

Type: conference-paper

Source: Annual Symposium on Foundations of Computer Science

DOI: 10.1109/sfcs.1992.267766

Authors: M. Dubiner, U. Zwick

Institution: Tel Aviv 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: W2027831741

FWCI: 0.329

Cites: 17

Cited by: 5

Related to: 10