# Computational number theory

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

2019

- 2019

Literature considers under the name unimaginable numbers any positive integer going beyond any physical application, with this… (More)

Is this relevant?

2016

2016

- SODA
- 2016

This paper gives polynomial time quantum algorithms for computing the ideal class group (CGP) under the Generalized Riemann… (More)

Is this relevant?

2012

2012

- 2012

Recall that a linear code C is just a subspace of Fq . We saw last time that by picking a basis of C we can construct what is… (More)

Is this relevant?

Review

2008

Review

2008

- 2008

The analysis of many number theoretic algorithms turns on the role played by integers which have only small prime factors; such… (More)

Is this relevant?

2007

2007

- 2007

The course will be an introductory course centered around various aspects of computational number theory. In particular, the… (More)

Is this relevant?

2006

2006

- 2006

Historically, computation has been a driving force in the development of mathematics. To help measure the sizes of their fields… (More)

Is this relevant?

2004

2004

- 2004

An attractive and challenging problem in computational number theory is to count in an e*cient manner the number of solutions to… (More)

Is this relevant?

2004

2004

- ACM SIGSAM Bulletin
- 2004

The Algorithmic Number Theory Symposium (ANTS) meetings are held bianually since 1994, and have become the premier international… (More)

Is this relevant?

1989

1989

- 1989

In recent years, many probabilistic algorithms (i.e., algorithms that can toss coins) that run in polynomial time have been… (More)

Is this relevant?

1982

1982

- 23rd Annual Symposium on Foundations of Computer…
- 1982

The Higher Reciprocity Laws are considered to be among the deepest and most fundamental results in number theory. Yet, they have… (More)

Is this relevant?