scientific article; zbMATH DE number 1559536

MaRDI QIDQ4526984zbMATH OpenFDO

Authors Ketan D. Mulmuley

Publication date 28 February 2001

zbMATH Keywords

lower bounds on parallel complexity

Mathematics Subject Classification ID

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

Recommendations

• Lower Bounds in a Parallel Model without Bit Operations
• An \NC Algorithm for Minimum Cuts
• Lower bounds for parallel linear programming and other problems
• scientific article; zbMATH DE number 1775437
• scientific article; zbMATH DE number 176871

Cited in

(3)

• The enumerability of P collapses P to NC
• Lower Bounds in a Parallel Model without Bit Operations
• Mathematical Foundations of Computer Science 2004

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 Q4526984)