scientific article; zbMATH DE number 1499078

MaRDI QIDQ4501130zbMATH OpenFDO

Authors F. Ablayev

Publication date 3 September 2000

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)

Cited in

(1)

• Lower bounds for one-way probabilistic communication complexity and their application to space 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 Q4501130)