Corpus ID: 56281614

On the Millennium Prize Problems

@article{Martila2015OnTM,
  title={On the Millennium Prize Problems},
  author={D. Martila},
  journal={viXra},
  year={2015}
}
There is Prize committee (claymath.org), which requires publication in worldwide reputable mathematics journal and at least two years of following scientific admiration. Why then the Grisha Perelman has published only in a forum (arXiv), publication was unclear as the crazy sketch; but mummy child “Grisha” have being forced to accept the Millennium Prize? Am I simply ugly or poor? If the following text would not be accepted by committee as the pay-able proofs (but I hope for) then let at least… Expand
32 Citations

Figures from this paper

Pariah moonshine
  • 10
  • PDF
Can one design a geometry engine?
  • J. Makowsky
  • Mathematics, Computer Science
  • Annals of Mathematics and Artificial Intelligence
  • 2018
  • 2
What is the question?
  • 1
is a proper subset of NP
Witness encryption and its applications
  • 233
  • PDF
Undecidability of the spectral gap
  • 151
  • PDF
...
1
2
3
4
...

References

SHOWING 1-10 OF 250 REFERENCES
Generic oracles and oracle classes
  • M. Blum, R. Impagliazzo
  • Computer Science
  • 28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
  • 1987
  • 158
  • PDF
A personal view of average-case complexity
  • R. Impagliazzo
  • Computer Science
  • Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference
  • 1995
  • 167
  • PDF
The Relative Efficiency of Propositional Proof Systems
  • 874
  • PDF
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
  • 553
Reducibility Among Combinatorial Problems
  • R. Karp
  • Computer Science
  • 50 Years of Integer Programming
  • 2010
  • 4,856
  • PDF
...
1
2
3
4
5
...