The Complexity of the Counting Constraint Satisfaction Problem

Andreǐ A. Bulatov

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

ScienceGate Book Chapters

JOURNAL ARTICLE

The Complexity of the Counting Constraint Satisfaction Problem

Andreǐ A. Bulatov

Year: 2008 Journal: Lecture notes in computer science Vol: 60 (5)Pages: 646-661 Publisher: Springer Science+Business Media

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

Get Full-Text PDF Get Analytical Report

Keywords:

Homomorphism Constraint satisfaction problem Constraint (computer-aided design) Counting problem Complexity of constraint satisfaction Mathematics Discrete mathematics Time complexity Polynomial Constraint satisfaction Vocabulary Combinatorics Local consistency Linguistics

Metrics

Cited By

0.48

FWCI (Field Weighted Citation Impact)

Refs

0.55

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Data Management and Algorithms

Physical Sciences → Computer Science → Signal Processing

Logic, Reasoning, and Knowledge

Physical Sciences → Computer Science → Artificial Intelligence

Bayesian Modeling and Causal Inference

Physical Sciences → Computer Science → Artificial Intelligence

The Complexity of the Counting Constraint Satisfaction Problem

Metrics

Citation History

Topics

Related Documents

Complexity Classification of Complex-Weighted Counting Acyclic Constraint Satisfaction Problems

The Complexity of the Distributed Constraint Satisfaction Problem

The Complexity of the Distributed Constraint Satisfaction Problem

An Effective Dichotomy for the Counting Constraint Satisfaction Problem

Counting Constraint Satisfaction Problems