"A constructive proof presenting languages in $Σ_2^P$ that cannot be ..."

Sunny Daniels (2014)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2021-01-23

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/Daniels14a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/Daniels14a
Sunny Daniels:
A constructive proof presenting languages in $Σ_2^P$ that cannot be decided by circuit families of size $n^k$. CoRR abs/1408.6334 (2014)

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.