|
Volumn 2821, Issue , 2003, Pages 580-590
|
An arrangement calculus, its complexity, and algorithmic properties
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
COMPUTER SIMULATION;
EXPERT SYSTEMS;
FORMAL LOGIC;
MATHEMATICAL TRANSFORMATIONS;
OPTIMIZATION;
PROBLEM SOLVING;
ARTIFICIAL INTELLIGENCE;
COMPUTATIONAL COMPLEXITY;
PARALLEL PROCESSING SYSTEMS;
CONCRETE ALGORITHMS;
INTEGRATED REPRESENTATION;
LOGICAL CALCULUS;
REASONING PROBLEMS;
ALGORITHM FOR SOLVING;
ALGORITHMIC PROPERTIES;
GRID STRUCTURES;
LOGICAL CALCULI;
NP-COMPLETENESS;
SATISFIABILITY PROBLEMS;
SPATIAL REASONING;
COMPUTATIONAL COMPLEXITY;
CALCULATIONS;
|
EID: 9444269195
PISSN: 03029743
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1007/978-3-540-39451-8_42 Document Type: Conference Paper |
Times cited : (12)
|
References (12)
|