Investigating solvability and complexity of linear active networks by means of matroids (Q4193403)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3632384
Language Label Description Also known as
default for all languages
No label defined
    English
    Investigating solvability and complexity of linear active networks by means of matroids
    scientific article; zbMATH DE number 3632384

      Statements

      Investigating solvability and complexity of linear active networks by means of matroids (English)
      0 references
      0 references
      1979
      0 references
      Order of Complexity of Linear Active Networks
      0 references
      Matroid Partition Algorithm
      0 references

      Identifiers