"Randomized VS. Deterministic Decision Tree Complexity for Read-Once ..."

Rafi Heiman, Avi Wigderson (1991)

> Home

Details and statistics

DOI: 10.1007/BF01212962

access: closed

type: Journal Article

metadata version: 2020-03-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cc/HeimanW91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cc/HeimanW91
Rafi Heiman, Avi Wigderson:
Randomized VS. Deterministic Decision Tree Complexity for Read-Once Boolean Functions. Comput. Complex. 1: 311-329 (1991)

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.