The complexity of approximating conservative counting CSPs.
Work
Year: 2013
Type: article
Institutions Shanghai Jiao Tong University, University of Leeds, University of Liverpool, Queen Mary University of London, Microsoft (United States)
Cites:
Cited by: 3
Related to: 20
FWCI: 0.487
Citation percentile (by year/subfield): 22.61
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed