"On the complexity of branching programs and decision trees for clique ..."

Ingo Wegener (1988)

> Home

Details and statistics

DOI: 10.1145/42282.46161

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/Wegener88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/Wegener88
Ingo Wegener:
On the complexity of branching programs and decision trees for clique functions. J. ACM 35(2): 461-471 (1988)

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.