Counting factorisations of monomials over rings of integers modulo $N$

Type: Preprint

Publication Date: 2017-11-15

Citations: 1

Locations

  • arXiv (Cornell University) - View

Similar Works

Action Title Year Authors
+ Counting factorisations of monomials over rings of integers modulo $N$ 2017 Jonathan E. Hickman
James Wright
+ PDF Chat Counting factorisations of monomials over rings of integers modulo N 2019 Jonathan Hickman
James Wright
+ Solutions to polynomial congruenceswith variables restricted to a box 2024 Todd Cochrane
Konstantinos Kydoniatis
Craig Spencer
+ Sets of Linear Forms Which Are Hard to Compute 2021 Michael Kaminski
Igor E. Shparlinski
+ On product decomposition 2022 Ming-Deh A. Huang
+ On sets of linear forms of maximal complexity 2021 Michael Kaminski
Igor E. Shparlinski
Michel Waldschmidt
+ PDF Chat On sets of linear forms of maximal complexity 2022 Michael Kaminski
Igor E. Shparlinski
Michel Waldschmidt
+ PDF Chat Reading Rational Univariate Representations on lexicographic Groebner bases 2024 Alexander Demin
Fabrice Rouillier
J. Gavilanes Ruiz
+ Factorisation of Polynomials 2022 Ian Stewart
+ Factorisation of Polynomials 2015
+ PDF Chat Solving Bivariate Quadratic Congruences in Random Polynomial Time 1987 Leonard M. Adleman
Dennis R. Estes
Kevin S. McCurley
+ Two terms with known prime divisors adding to a power: REVISED 2020 Reese Scott
Robert Styer
+ Monomial congruences 1978 Melvyn B. Nathanson
+ PDF Chat Ideal membership in polynomial rings over the integers 2004 Matthias Aschenbrenner
+ Polynomial Congruences 2016
+ PDF Chat FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER ℤ 2012 Daniel Birmajer
Juan B. Gil
Michael D. Weiner
+ A simple scheme for polynomial factorization 1975 Tien D. Bui
+ Lacunary Polynomial Compositions 2021 Alessio Moscariello
+ Composite polynomials in linear recurrence sequences 2018 Clemens Fuchs
Christina Karolus
+ The Number of Terms in a Polynomial 1941 Franz E. Hohn