A combinatorial constraint satisfaction problem dichotomy classification conjecture

Jaroslav Nešetřil; Mark Siggers; László Zádori

doi:10.1016/j.ejc.2009.02.007

ScienceGate Book Chapters

JOURNAL ARTICLE

A combinatorial constraint satisfaction problem dichotomy classification conjecture

Jaroslav Nešetřil Mark Siggers László Zádori

Year: 2009 Journal: European Journal of Combinatorics Vol: 31 (1)Pages: 280-296 Publisher: Elsevier BV

DOI: 10.1016/j.ejc.2009.02.007

Get Full-Text PDF Get Analytical Report

Keywords:

Conjecture Mathematics Combinatorics Constraint satisfaction problem Partition (number theory) Mathematical proof Discrete mathematics Extension (predicate logic) Computer science

Metrics

Cited By

2.16

FWCI (Field Weighted Citation Impact)

Refs

0.84

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Combinatorial Mathematics

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

A combinatorial constraint satisfaction problem dichotomy classification conjecture

Metrics

Citation History

Topics

Related Documents

The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems

Combinatorial Designs on Constraint Satisfaction Problem (VRP)

An Effective Dichotomy for the Counting Constraint Satisfaction Problem

Towards a dichotomy theorem for the counting constraint satisfaction problem

Towards a dichotomy theorem for the counting constraint satisfaction problem