메뉴 건너뛰기





Volumn , Issue , 1993, Pages 731-736

Decomposition of domains based on the micro-structure of finite constraint-satisfaction problems

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; EQUIVALENCE CLASSES; GRAPH THEORY; NUMERICAL ANALYSIS; ONLINE SEARCHING; PATTERN RECOGNITION; POLYNOMIALS;

EID: 0027707380     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (78)

References (0)
  • Reference 정보가 존재하지 않습니다.

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.