27 citations · 49 across the 15 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.LO2021
Enumerating Independent Linear Inferences
Anupam Das, Alex Rice
A linear inference is a valid inequality of Boolean algebra in which each variable occurs at most once on each side. In this work we leverage recently developed graphical represent…
cs.LO2021
Cyclic Implicit Complexity
Gianluca Curzi, Anupam Das
Circular (or cyclic) proofs have received increasing attention in recent years, and have been proposed as an alternative setting for studying (co)inductive reasoning. In particular…
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,…