default search action

combined dblp search
author search
venue search
publication search

ask others

"Improving exhaustive search implies superpolynomial lower bounds."

Ryan Williams (2010)

> Home

Details and statistics

DOI: 10.1145/1806689.1806723

access: closed

type: Conference or Workshop Paper

metadata version: 2019-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/Williams10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/Williams10
Ryan Williams:
Improving exhaustive search implies superpolynomial lower bounds. STOC 2010: 231-240

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.