Publication:2739445
From MaRDI portal
zbMath1006.11084MaRDI QIDQ2739445
Publication date: 9 September 2001
algorithmsfactoring polynomials over finite fieldsrandom polynomial time algorithmaverage polynomial time complexitystable coloring of tournaments
Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items
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.