Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"On the complexity of algebraic numbers, and the bit-complexity of ..."

Eric Allender et al. (2023)

> Home

Details and statistics

DOI: 10.3233/COM-220407

access: closed

type: Journal Article

metadata version: 2024-08-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/computability/AllenderBDP23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/computability/AllenderBDP23
Eric Allender, Nikhil Balaji, Samir Datta, Rameshwar Pratap:
On the complexity of algebraic numbers, and the bit-complexity of straight-line programs. Comput. 12(2): 145-173 (2023)

a service of

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.