"On the Complexity of Random Satisfiability Problems with Planted Solutions."

Vitaly Feldman, Will Perkins, Santosh S. Vempala (2013)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2022-07-08

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/FeldmanPV13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/FeldmanPV13
Vitaly Feldman, Will Perkins, Santosh S. Vempala:
On the Complexity of Random Satisfiability Problems with Planted Solutions. CoRR abs/1311.4821 (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.