Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Sam Buss, Anupam Das 0002, Alexander Knop
Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs
CSL, 2020.

CSL 2020
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{CSL-2020-Buss0K,
	author        = "Sam Buss and Anupam Das 0002 and Alexander Knop",
	booktitle     = "{Proceedings of the 28th EACSL Annual Conference on Computer Science Logic}",
	doi           = "10.4230/LIPIcs.CSL.2020.12",
	isbn          = "978-3-95977-132-0",
	pages         = "17",
	publisher     = "{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}",
	title         = "{Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs}",
	year          = 2020,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.