The real positive definite completion problem ; cycle completability /
Material type:
TextSeries: Memoirs of the AMS ; v. 122 | no. 584 4th of 5 nos., July 1996Publication details: Providence: American Mathematical Society, 1996Description: viii, 69pDDC classification: - 511.5 B274.RP
| Item type | Current library | Call number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|
Book
|
ISID | 511.5 B274.RP (Browse shelf(Opens below)) | Available | DP23168 |
Browsing ISID shelves Close shelf browser (Hides shelf browser)
|
|
No cover image available | No cover image available |
|
No cover image available | No cover image available | ||
| 511.5 B216.DT Digraphs; theory, algorithms and applications | 511.5 B222.GM Graphs and matrices / | 511.5 B269.DP Dynamical processess on complex networks / | 511.5 B274.RP The real positive definite completion problem ; cycle completability / | 511.5 B393.CC Computing the continuous discretely : integer-point enumeration in polyhedra / | 511.5 B422.ST Selected topics in graph theory / | 511.5 B422.ST Selected topics in graph theory / |
There are no comments on this title.
Log in to your account to post a comment.