Some independence results in complexity theory<sup>†</sup> (Q3751002): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4091421 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A generalization of the fast LUP matrix decomposition algorithm and applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5516901 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Berechnung und Programm. II / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Gaussian elimination is not optimal / rank | |||
Normal rank | |||
Latest revision as of 18:30, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some independence results in complexity theory<sup>†</sup> |
scientific article |
Statements
Some independence results in complexity theory<sup>†</sup> (English)
0 references
1985
0 references
algebraic function
0 references
straight-line program
0 references
oracle
0 references
matrix multiplication
0 references
transitive closure of a graph
0 references
rank of a matrix
0 references
set of independent rows and columns in a matrix
0 references
maximum bipartite matching
0 references
0 references
