scientific article; zbMATH DE number 619540
From MaRDI portal
Publication:4302461
zbMATH Open0797.68085MaRDI QIDQ4302461
Publication date: 13 September 1994
Title of this publication is not available (Why is that?)
Analysis of algorithms and problem complexity (68Q25) Polynomials in general fields (irreducibility, etc.) (12E05)
Related Items (8)
Lower bound of the complexity of functions over a finite field of order 4 in the class of polarized polynomials ⋮ The black-box query complexity of polynomial summation ⋮ Lower bounds for polynomials of many variables ⋮ Title not available (Why is that?) ⋮ Lower bounds of complexity for polarized polynomials over finite fields ⋮ Tight worst-case bounds for polynomial loop programs ⋮ On lower bounds for the complexity of polynomials and their multiples ⋮ Title not available (Why is that?)
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 Q4302461)
