Models of Computation, Riemann Hypothesis, and Classical Mathematics

Authors:
Rusins Freivalds
Affiliations:
-
Venue:
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Year:
1998

Citing 17
Cited 1

Riemann hypothesis and finding roots over finite fields

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Constructing nonresidues in finite fields and the extended Riemann hypothesis

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Realistic analysis of some randomized algorithms

Journal of Computer and System Sciences
Generalized Riemann hypothesis and factoring polynomials over finite fields

Journal of Algorithms
Existence of short proofs for nondivisibility of sparse polynomials under the extended Riemann hypothesis

ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Molecular computation of solutions to combinatorial problems

Science
Some results on pseudosquares

Mathematics of Computation
Probabilistic Two-Way Machines

Proceedings on Mathematical Foundations of Computer Science
On Randomized Versus Deterministic Computation

ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Lower Space Bounds for Randomized Computation

ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
On the power of quantum finite state automata

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
1-way quantum finite automata: strengths, weaknesses and generalizations

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Fast algorithms under the extended riemann hypothesis: A concrete estimate

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Probabilistic algorithms in finite fields

SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
Algorithms for quantum computation: discrete logarithms and factoring

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
The recognition problem for the set of perfect squares

SWAT '66 Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)
Riemann's hypothesis and tests for primality

Journal of Computer and System Sciences

Frequency prediction of functions

MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Classical mathematics is a source of ideas used by Computer Science since the very first days. Surprisingly, there is still much to be found. Computer scientists, especially, those in Theoretical Computer Science find inspiring ideas both in old notions and results, and in the 20th century mathematics. The latest decades have brought us evidence that computer people will soon study quantum physics and modern biology just to understand what computers are doing.