Polynomial time calculi.
From MaRDI portal
Logic in computer science (03B70) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Nonnumerical algorithms (68W05)
Recommendations
Cited in
(4)
This page was built for publication: Polynomial time calculi.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3628772)