Proof complexity of positive branching programs
We investigate the proof complexity of systems based on positive branching programs, i.e. non-deterministic branching programs (NBPs) where, for any 0-transition between two nodes, there is also a 1-transition. Positive NBPs compute monotone Boolean functions, just like negation-free circuits or for...
Bewaard in:
| Hoofdauteurs: | , |
|---|---|
| Formaat: | Artigo |
| Taal: | Inglês |
| Gepubliceerd in: |
Logical Methods in Computer Science e.V.
2025-03-01
|
| Reeks: | Logical Methods in Computer Science |
| Onderwerpen: | |
| Online toegang: | http://lmcs.episciences.org/13874/pdf |
| Tags: |
Geen labels, Wees de eerste die dit record labelt!
|