Explicit upper bounds for exponential sums over primes.
Hedi DaboussiJoël RivatPublished in: Math. Comput. (2001)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- lower and upper bounds
- worst case
- tight bounds
- branch and bound algorithm
- tight upper and lower bounds
- efficiently computable
- branch and bound
- upper bounding
- error probability
- sample complexity
- random variables
- concept classes
- machine learning
- sample size
- sufficient conditions
- active learning
- search algorithm
- decision trees
- learning algorithm