Counting networks are practically linearizable (Q2942741)
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 6481020
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting networks are practically linearizable |
scientific article; zbMATH DE number 6481020 |
Statements
Counting networks are practically linearizable (English)
0 references
11 September 2015
0 references
