📣 Try out the NEW Gateway to Research and let us know what you think.

We're looking for users to test the new service during August and September and share their feedback. Express your interest by completing this short form.

Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs (2020)

First Author: Buss S

Attributed to: Structure vs. Invariants in Proofs (StrIP) funded by UKRI FLF

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.4230/lipics.csl.2020.12

Publication URI: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.12

Type: Conference/Paper/Proceeding/Abstract

Volume: 152