UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

The complexity of constraint satisfaction problems for small relation algebras

Cristani, M; Hirsch, R; (2004) The complexity of constraint satisfaction problems for small relation algebras. ARTIFICIAL INTELLIGENCE , 156 (2) pp. 177-196. 10.1016/j.artint.2004.02.003.

Full text not available from this repository.
Type: Article
Title: The complexity of constraint satisfaction problems for small relation algebras
DOI: 10.1016/j.artint.2004.02.003
Keywords: Science & Technology, Technology, Computer Science, Artificial Intelligence, Computer Science, COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE, relation algebra, constraint satisfaction problem, computational complexity, REGION CONNECTION CALCULUS, INTERVALS, TIME
UCL classification: UCL > School of BEAMS
UCL > School of BEAMS > Faculty of Engineering Science
URI: http://discovery.ucl.ac.uk/id/eprint/13345
Downloads since deposit
0Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item