✳flâneur — a map of the web's best reading
thesis-FIXED.pdf
hjaltman.github.io · 78,204 words · saved by 1 readers
N/A
# link_157y9mrxigl.pdf ## Metadata - PDFFormatVersion=1.5 - IsLinearized=false - IsAcroFormPresent=false - IsXFAPresent=false - IsCollectionPresent=false - IsSignaturesPresent=false - Creator=LaTeX with hyperref package - Producer=pdfTeX-1.40.14 - CreationDate=D:20140606210552-04'00' - ModDate=D:20140606210552-04'00' - Trapped=False - Custom.PTEX.Fullbanner=This is pdfTeX, Version 3.1415926-2.5-1.40.14 (TeX Live 2013/Debian) kpathsea version 6.1.1 ## Contents ### Page 1 Integer Complexity, Addition Chains, and Well-OrderingbyHarry J. AltmanA dissertation submitted in partial fulfillment of
Explore this link on the map →saved by
related reading
- What's new | Updates on my research and expository papers, discussion of open problems, and other maths-related topics. By Terence Taoterrytao.wordpress.com
- Computational Complexityblog.computationalcomplexity.org
- Shtetl-Optimized >> Blog Archive >> The First Law of Complexodynamicsscottaaronson.blog
- Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- unit-distance-remarks.pdfcdn.openai.com
- Complexity Zoocomplexityzoo.net
- Complexity class - Wikipediaen.wikipedia.org
- 124 Discussion Thread | Erdős Problemserdosproblems.com
- Competitive Programmer's Handbookcses.fi
- nullstellensatzweb.math.princeton.edu
- Napkin.pdfvenhance.github.io
- Structure and Interpretation of Computer Programsmitp-content-server.mit.edu