Showing cs.CCShow all
2 papers · 1 filter
cs.CC2025
Prover-Adversary games for systems over (non-deterministic) branching programs
Anupam Das, Avgerinos Delkos
We introduce Pudlak-Buss style Prover-Adversary games to characterise proof systems reasoning over deterministic branching programs (BPs) and non-deterministic branching programs (…
cs.CC2021
Proof complexity of positive branching programs
Anupam Das, Avgerinos Delkos
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,…