Parallel algorithms for matroid intersection and matroid parity (Q5261053): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Division in logspace-uniform<i>NC</i><sup>1</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid matching via mixed skew-symmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomizing polynomial identity tests means proving circuit lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems / rank
 
Normal rank

Revision as of 10:44, 10 July 2024

scientific article; zbMATH DE number 6454690
Language Label Description Also known as
English
Parallel algorithms for matroid intersection and matroid parity
scientific article; zbMATH DE number 6454690

    Statements

    Identifiers