Bipartite perfect matching in pseudo-deterministic NC
From MaRDI portal
(Redirected from Publication:5111418)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Randomized algorithms (68W20)
Recommendations
Cited in
(13)- Quasipolynomial representation of transversal matroids with applications in parameterized complexity
- NC algorithms for computing a perfect matching and a maximum flow in one-crossing-minor-free graphs
- Bipartite perfect matching is in quasi-NC
- NC algorithms for weighted planar perfect matching and related problems
- Brief announcement: Zero-knowledge protocols for search problems
- On Pseudodeterministic Approximation Algorithms.
- Planar Maximum Matching: Towards a Parallel Algorithm
- scientific article; zbMATH DE number 7758310 (Why is no real title available?)
- On the parallel complexity of constrained read-once refutations in UTVPI constraint systems
- A deterministic parallel reduction from weighted matroid intersection search to decision
- Multi-pseudodeterministic algorithms
- Complete problems for multi-pseudodeterministic computations
- Polynomial-time pseudodeterministic construction of primes
This page was built for publication: Bipartite perfect matching in pseudo-deterministic NC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111418)
