"Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean ..."

Rafi Heiman, Avi Wigderson (1991)

> Home

Details and statistics

DOI: 10.1109/SCT.1991.160258

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

- view
  authority control:
- export record
  dblp key:
  - conf/coco/HeimanW91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/HeimanW91
Rafi Heiman, Avi Wigderson:
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions. SCT 1991: 172-179

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.