"Proof complexity of systems of (non-deterministic) decision trees and ..."

Sam Buss, Anupam Das, Alexander Knop (2019)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2019-10-25

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-1910-08503
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1910-08503
Sam Buss, Anupam Das, Alexander Knop:
Proof complexity of systems of (non-deterministic) decision trees and branching programs. CoRR abs/1910.08503 (2019)

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.