Family of matroid intersection algorithms for the computation of approximated symbolic network functions

Proceedings - IEEE International Symposium on Circuits and Systems

Volumn 4, Issue , 1996, Pages 806-809

  Wambacq, Piet ^a   Fernandez, Francisco V ^a   Gielen, Georges ^a   Sansen, Willy ^a   Rodriguez Vazquez, Angel ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; ELECTRIC NETWORK ANALYSIS; ELECTRIC NETWORK SYNTHESIS; FUNCTIONS; GRAPH THEORY; INTEGRATED CIRCUITS; MATRIX ALGEBRA; POLYNOMIALS; TRANSISTORS;

ANALOG CIRCUITS; APPROXIMATED SYMBOLIC NETWORK FUNCTIONS; MATROID INTERSECTION ALGORITHMS; TRANSISTOR CIRCUITS; TWO GRAPH METHOD;

ALGORITHMS;

EID: 0029712356     PISSN: 02714310     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)