Pages that link to "Item:Q1262128"
From MaRDI portal
The following pages link to Improved processor bounds for combinatorial problems in RNC (Q1262128):
Displayed 9 items.
- Parallel complexity of the regular code problem (Q913513) (← links)
- Subtree isomorphism is in random NC (Q922707) (← links)
- Complexity of parallel matrix computations (Q1100892) (← links)
- Parallel evaluation of the determinant and of the inverse of a matrix (Q1115596) (← links)
- Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity (Q1343167) (← links)
- Computation of approximate polynomial GCDs and an extension (Q1854432) (← links)
- Processor efficient parallel matching (Q2471700) (← links)
- THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗† (Q4820105) (← links)
- Parallel output-sensitive algorithms for combinatorial and linear algebra problems (Q5943098) (← links)