Deterministic Number-Theoretic Algorithms is a class of algorithmic methods in computational number theory that, given a well-defined input, always produces the same output through a predictable sequence of steps without recourse to randomness or probabilistic choices.
9
Publications
1.2K
Citations
23
Authors
15
Institutions
Publications per year
2017–2026
1
Parents
Publications
9
Manindra Agrawal, Neeraj Kayal, Nitin Saxena · Annals of Mathematics · 2004 · 922 citations · Full text
Deterministic approximate counting of depth-2 circuits
Michael Luby, Boban Veličković, Avi Wigderson · 2002 · 77 citations
1–5 of 9
Authors
23
- JČ
1
h-index
- AW
1
h-index
- JI
1
h-index
- KKKonstantinos Koiliaris
University of Illinois Urbana-Champaign, United States
1 publications · 49 citations
1
h-index
- PS
1
h-index
1–5 of 23
Institutions
15
National Institute of Standards and Technology
Gaithersburg, United States
1 h-index
2 publications
88 citations
University of Minnesota
Minneapolis, United States
1 h-index
1 publications
43 citations
University of California, Berkeley
Berkeley, United States
1 h-index
1 publications
77 citations
Polish Academy of Sciences
Warsaw, Poland
1 h-index
1 publications
19 citations
Princeton University
Princeton, United States
1 h-index
1 publications
77 citations
Research!America (United States)
Alexandria, United States
1 h-index
1 publications
49 citations
Yahoo (United States)
Sunnyvale, United States
1 h-index
1 publications
49 citations
National Institute of Standards
Giza, Egypt
1 h-index
2 publications
88 citations
1–8 of 15
Venues
- Mathematics of Computation
MCOM · 2 publications · 53 citations
2
h-index
- ACM Transactions on Algorithms
TALG · 1 publications · 49 citations
1
h-index
- Lecture notes in computer science
LNCS · Book series · 1 publications · 10 citations
1
h-index
- Annals of Mathematics
1 publications · 922 citations
1
h-index
- IEEE Transactions on Computers
1 publications · 11 citations
1
h-index
1–5