Pages that link to "Item:Q896677"
From MaRDI portal
The following pages link to Positive and negative proofs for circuits and branching programs (Q896677):
Displaying 4 items.
- Proof complexity of monotone branching programs (Q2104254) (← links)
- Succinct certification of monotone circuits (Q2232601) (← links)
- Computing the best-case energy complexity of satisfying assignments in monotone circuits (Q2674710) (← links)
- Worst-case groundness analysis using positive Boolean functions (Q4719376) (← links)