"Branching Programs Provide Lower Bounds on the Areas of Multilective ..."

Juraj Hromkovic et al. (1992)

> Home

Details and statistics

DOI: 10.1016/0890-5401(92)90046-I

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/iandc/HromkovicKMW92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/HromkovicKMW92
Juraj Hromkovic, Matthias Krause, Christoph Meinel, Stephan Waack:
Branching Programs Provide Lower Bounds on the Areas of Multilective Deterministic and Nondeterministic VLSI-Circuits. Inf. Comput. 96(2): 168-178 (1992)

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.