"On the Query Complexity of Sets."

Richard Beigel et al. (1996)

> Home

Details and statistics

DOI: 10.1007/3-540-61550-4_149

access: closed

type: Conference or Workshop Paper

metadata version: 2021-01-11

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/mfcs/BeigelGKMS96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/BeigelGKMS96
Richard Beigel, William I. Gasarch, Martin Kummer, Timothy H. McNicholl, Frank Stephan:
On the Query Complexity of Sets. MFCS 1996: 206-217

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.