scientific article; zbMATH DE number 1335883

zbMATH Open0935.68036MaRDI QIDQ4258574FDOQ4258574

Authors: Klaus Reinhardt, Eric Allender 

Publication date: 4 May 2000

Title of this publication is not available (Why is that?)

Recommendations

• Isolation, matching, and counting uniform and nonuniform upper bounds
• Space complexity of perfect matching in bounded genus bipartite graphs
• Deterministically isolating a perfect matching in bipartite planar graphs
• Space complexity of perfect matching in bounded genus bipartite graphs
• Bipartite perfect matching is in quasi-NC

zbMATH Keywords

perfect matching problem

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (3)

• NL-printable sets and nondeterministic Kolmogorov complexity
• Isolation, matching, and counting uniform and nonuniform upper bounds
• NL-printable sets and nondeterministic Kolmogorov complexity

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4258574)