Work

The Complexity of the Counting Constraint Satisfaction Problem

Year: 2008

Type: conference-paper

Source: Lecture notes in computer science

DOI: 10.1007/978-3-540-70575-8_53

Author: Andrei A. Bulatov

Institution: Simon Fraser University

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W253183949

FWCI: 10.48

Cites: 59

Cited by: 190

Related to: 20