|
Volumn 8, Issue 3, 1998, Pages 271-282
|
Tighter and broader complexity results for reconfigurable models
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
COMPUTATIONAL COMPLEXITY;
COMPUTER NETWORKS;
MATHEMATICAL MODELS;
COMPUTATIONAL METHODS;
POLYNOMIALS;
PROBLEM SOLVING;
COMPLEXITY CLASSES;
BOUNDED COMPLEXITY;
CIRCUIT-DEFINED CLASSES;
DIRECTED RECONFIGURABLE NETWORK;
PROGRAM PROCESSORS;
PARALLEL PROCESSING SYSTEMS;
|
EID: 0032157813
PISSN: 01296264
EISSN: None
Source Type: Journal
DOI: 10.1142/S0129626498000304 Document Type: Article |
Times cited : (20)
|
References (1)
|