Unique solvability and order of complexity of linear networks containing memorylessn-ports (Q4178929): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 13:03, 6 February 2024

scientific article; zbMATH DE number 3614672
Language Label Description Also known as
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
    0 references
    1979
    0 references
    0 references
    0 references
    0 references
    0 references
    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