|
Volumn , Issue , 1997, Pages 58-64
|
Reducing the complexity of ILP formulations for synthesis
a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPUTATIONAL COMPLEXITY;
CONSTRAINT THEORY;
DATA TRANSFER;
GRAPH THEORY;
INTEGER PROGRAMMING;
LINEAR PROGRAMMING;
PROBLEM SOLVING;
DATA FLOW GRAPH (DFG);
PARTITIONING METHODOLOGY;
DIGITAL ARITHMETIC;
|
EID: 0030650126
PISSN: 10801820
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (8)
|
References (21)
|