scientific article

zbMath1006.11084MaRDI QIDQ2739445

Qi Cheng, Ming-Deh A. Huang

Publication date: 9 September 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmsfactoring polynomials over finite fieldsrandom polynomial time algorithmaverage polynomial time complexitystable coloring of tournaments

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes ⋮ Unnamed Item ⋮ Trading GRH for algebra: Algorithms for factoring polynomials and related structures ⋮ Kolmogorov random graphs only have trivial stable colorings.

This page was built for publication: