Guest Column-Reference-Cited by-同舟云学术

Guest Column

Published:2023-02-28 Issue:1 Volume:54 Page:63-81
ISSN:0163-5700
Container-title:ACM SIGACT News
language:en
Short-container-title:SIGACT News

Author:

Allender Eric¹

Affiliation:

1. Rutgers University, Piscataway, NJ, USA

Abstract

The end is near. More precisely, the end of my time as a (non-emeritus) professor is near. Thus I'm particularly grateful to Lane for inviting me to share some thoughts here, because there are a few things that I want to get off my chest. The Computational Complexity Column provides the perfect podium for this.

Publisher

Association for Computing Machinery (ACM)

Subject

General Materials Science

Link

https://dl.acm.org/doi/pdf/10.1145/3586165.3586175

Reference88 articles.

1. Arithmetic Complexity, Kleene Closure, and Formal Power Series

2. Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem

3. [AB07] Boris Adamczewski and Yann Bugeaud . On the complexity of algebraic numbers I. Expansions in integer bases . Annals of Mathematics , pages 547 -- 565 , 2007 . [AB07] Boris Adamczewski and Yann Bugeaud. On the complexity of algebraic numbers I. Expansions in integer bases. Annals of Mathematics, pages 547--565, 2007.

4. [ABDP23] Eric Allender , Nikhil Balaji , Samir Datta , and Rameshwar Pratap . On the complexity of algebraic numbers, and the bit-complexity of straight-line programs . Computability (The Journal of the Association Computability in Europe) , 2023 . To Appear. See also ECCC Report TR22-053. [ABDP23] Eric Allender, Nikhil Balaji, Samir Datta, and Rameshwar Pratap. On the complexity of algebraic numbers, and the bit-complexity of straight-line programs. Computability (The Journal of the Association Computability in Europe), 2023. To Appear. See also ECCC Report TR22-053.

5. [ABK06a] Eric Allender , Harry Buhrman , and Michal Kouck´y . What can be efficiently reduced to the Kolmogorov-random strings? Ann. Pure Appl. Log., 138(1--3):2--19 , 2006 . [ABK06a] Eric Allender, Harry Buhrman, and Michal Kouck´y. What can be efficiently reduced to the Kolmogorov-random strings? Ann. Pure Appl. Log., 138(1--3):2--19, 2006.