메뉴 건너뛰기




Volumn 11, Issue 1, 1997, Pages 59-70

A look at clp: theory and application

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DATA STRUCTURES; DIGITAL ARITHMETIC; PROBLEM SOLVING;

EID: 0030785985     PISSN: 08839514     EISSN: 10876545     Source Type: Journal    
DOI: 10.1080/088395197118343     Document Type: Article
Times cited : (4)

References (8)
  • 7
    • 85011180746 scopus 로고
    • OCE14, VS a.s. Kosice. Technical Report. Technical University of Kosice, May
    • OCE14, VS a.s. Kosice. Technical Report. Technical University of Kosice, May 1993.
    • (1993)
  • 8
    • 26844469818 scopus 로고
    • Constraint satisfaction and constraint programming: A brief lead-in
    • B. Mayoh, E. Tyungu, and J. Penjam (eds.), New York: Springer-Verlag
    • Mayoh, B., E. Tyungu, and T. Uuštalu. 1994. Constraint satisfaction and constraint programming: A brief lead-in. In B. Mayoh, E. Tyungu, and J. Penjam (eds.), Constraint programming. New York: Springer-Verlag.
    • (1994) Constraint Programming
    • Mayoh, B.1    Tyungu, E.2    Uuštalu, T.3


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