The computational complexity of matroid properties (Q3873544): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5619114 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Random matroids / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimum partition of a matroid into independent subsets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On recognizing graph properties from adjacency matrices / rank | |||
Normal rank | |||
Latest revision as of 04:03, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The computational complexity of matroid properties |
scientific article |
Statements
The computational complexity of matroid properties (English)
0 references
1980
0 references
oracle Turing machines
0 references
