GNU TeXmacs company blog
TeXmacs 1.99.14 released. Take a look at this research paper exported to HTML
Assuming a widely-believed hypothesis concerning the least prime in an arithmetic progression, we show that two -bit integers can be multiplied in time on a Turing machine with a finite number of tapes; we also show that polynomials of degree less than over a finite field with elements can be multiplied in time …
- Points
- 141
- HN comments
- 71
- Submissions
- 1
- Cited by
- 0 commenters
Science & SpaceTools & Productivity2020
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Nov 4, 2020 | TeXmacs 1.99.14 released. Take a look at this research paper exported to HTML by amichail | 141 | 71 |
