Skip to main navigation
Skip to search
Skip to main content
University of Birmingham Home
Help & FAQ
Home
Research output
Profiles
Research units
Projects
Activities
Datasets
Equipment
Prizes
Press/Media
Search by expertise, name or affiliation
Proof complexity of positive branching programs
Anupam Das
, Avgerinos Delkos
Computer Science
Research output
:
Working paper/Preprint
›
Preprint
8
Downloads (Pure)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Proof complexity of positive branching programs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Proof Complexity
100%
Branching Programs
94%
Sequent Calculus
41%
Polynomial
27%
Dags
25%
Monotone Boolean Function
25%
Decision tree
22%
Counting Function
20%
Syntax
16%
Monotone
13%
Language
12%
Simulation
10%
Vertex of a graph
9%