"On the Complexity of Algebraic Numbers, and the Bit-Complexity of ..."

Eric Allender et al. (2022)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2022-07-11

- view
  - electronic edition @ weizmann.ac.il (open access)
- export record
  dblp key:
  - journals/eccc/AllenderBDP22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/AllenderBDP22
Eric Allender, Nikhil Balaji, Samir Datta, Rameshwar Pratap:
On the Complexity of Algebraic Numbers, and the Bit-Complexity of Straight-Line Programs. Electron. Colloquium Comput. Complex. TR22 (2022)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.