"Improving Exhaustive Search Implies Superpolynomial Lower Bounds."

Ryan Williams (2013)

> Home

Details and statistics

DOI: 10.1137/10080703X

access: closed

type: Journal Article

metadata version: 2018-11-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/Williams13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/Williams13
Ryan Williams:
Improving Exhaustive Search Implies Superpolynomial Lower Bounds. SIAM J. Comput. 42(3): 1218-1244 (2013)

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.