scientific article; zbMATH DE number 4172392

zbMATH Open0712.68051MaRDI QIDQ3197331FDOQ3197331

Vladimír Dančík

Publication date: 1990

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

zbMATH Keywords

computational complexitylower bound

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (4)

• Lower Bounds for Splittings by Linear Combinations
• \(\Delta_ 0\)-complexity of the relation \(y= \prod_{i\leq n} F(i)\)
• The straight line complexity of small factorials and primorials
• A nonlinear lower bound on the practical combinational complexity

   Recommendations

• Title not available (Why is that?) 👍 👎
• Easy lower bound for a strange computational model 👍 👎
• Lower bounds for the complexity of polynomials 👍 👎
• A Lower Bound for Matrix Multiplication 👍 👎
• A lower bound for the multiplication of polynomials modulo a polynomial 👍 👎

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