scientific article; zbMATH DE number 799766
From MaRDI portal
Publication:4847917
zbMath0842.11045MaRDI QIDQ4847917
Publication date: 28 July 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
integer factorizationstraight-line complexitystraight-line computationpolynomial with many rational roots
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Coloring of graphs and hypergraphs (05C15) Factorization (11Y05)
Related Items (6)
Terms of Lucas sequences having a large smooth divisor ⋮ Algorithms for Black-Box Fields and their Application to Cryptography ⋮ Few Product Gates But Many Zeros ⋮ Generic hardness of inversion on ring and its relation to self-bilinear map ⋮ A new method to obtain lower bounds for polynomial evaluation ⋮ Unnamed Item
This page was built for publication:
