"Complexity Lower Bounds for Computation Trees with Elementary ..."

Dima Grigoriev, Nicolai N. Vorobjov Jr. (1994)

> Home

Details and statistics

DOI: 10.1109/SFCS.1994.365736

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-23

- view
  authority control:
- export record
  dblp key:
  - conf/focs/GrigorievV94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/GrigorievV94
Dima Grigoriev, Nicolai N. Vorobjov Jr.:
Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates. FOCS 1994: 548-552

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.