Unique solvability and order of complexity of linear networks containing memorylessn-ports (Q4178929)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Unique solvability and order of complexity of linear networks containing memorylessn-ports |
scientific article; zbMATH DE number 3614672
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unique solvability and order of complexity of linear networks containing memorylessn-ports |
scientific article; zbMATH DE number 3614672 |
Statements
Unique solvability and order of complexity of linear networks containing memorylessn-ports (English)
0 references
1979
0 references
Matroid Partition Algorithms
0 references
Electric Networks
0 references
Unique Solvability
0 references
Memoryless N-Ports
0 references
Order of Complexity
0 references
Linear Networks
0 references
