Work

How hard is it to marry at random? (On the approximation of the permanent)

Year: 1986

Type: conference-paper

Source: ACM Symposium on Theory of Computing (STOC)

DOI: 10.1145/12130.12136

Author: A Z Broder

Institution: Defense Engineering Corporation (United States)

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

FWCI: 4.768

Cites: 10

Cited by: 178

Related to: 10