Congruence Solving Algorithms
Congruence Solving Algorithms is a class of algorithmic methods in number theory that systematically determine integer solutions to modular congruences by exploiting properties of residue classes, algebraic structures, and efficient computational techniques specific to congruence relations.
63
Publications
2K
Citations
101
Authors
60
Institutions
Publications per year
2017–2026
2
Parents
63
Reconstructing Truncated Integer Variables Satisfying Linear Congruences
Alan Frieze, Johan Håstad, Ravi Kannan et al. · SIAM Journal on Computing · 1988 · 112 citations
A course in computational number theory
Choice Reviews Online · 2000 · 101 citations
Weight congruences for p-ary cyclic codes
Robert J. McEliece · Discrete Mathematics · 1972 · 78 citations
1–5 of 63
101
3
h-index
2
h-index
2
h-index
2
h-index
1
h-index
1–5 of 101
60
Max Planck Institute for Informatics
Saarbrücken, Germany
2 h-index
2 publications
84 citations
University of Southern California
Los Angeles, United States
2 h-index
4 publications
60 citations
National Institute of Standards and Technology
Gaithersburg, United States
2 h-index
3 publications
44 citations
Laboratoire de Mathématiques d'Orsay
Orsay, France
2 h-index
2 publications
66 citations
Courant Institute of Mathematical Sciences
New York, United States
1 h-index
1 publications
21 citations

University of British Columbia
Vancouver, Canada
1 h-index
1 publications
32 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
1 h-index
2 publications
142 citations
Massachusetts Institute of Technology
Cambridge, United States
1 h-index
1 publications
112 citations
1–8 of 60
MCOM · 4 publications · 99 citations
4
h-index
3 publications · 62 citations
3
h-index
JAMS · 2 publications · 113 citations
2
h-index
TOMS · 2 publications · 22 citations
2
h-index
2 publications · 99 citations
2
h-index
1–5