BibSLEIGH
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
Collaborated with:
P.Baillot I.Oitavem D.Pous ∅ S.Buss A.Knop
Talks about:
polynomi (2) proof (2) non (2) determinist (1) characteris (1) wellfound (1) hierarchi (1) function (1) arithmet (1) theoret (1)

Person: Anupam Das 0002

DBLP DBLP: 0002:Anupam_Das

Contributed to:

CSL 20162016
CSL 20182018
IJCAR 20182018
CSL 20202020

Wrote 5 papers:

CSL-2016-BaillotD #linear #logic
Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic (PB, AD0), p. 18.
CSL-2018-DasO #polynomial #recursion
A Recursion-Theoretic Characterisation of the Positive Polynomial-Time Functions (AD0, IO), p. 17.
CSL-2018-DasP #algebra #proving
Non-Wellfounded Proof Theory For (Kleene+Action)(Algebras+Lattices) (AD0, DP), p. 18.
IJCAR-2018-Das #polynomial
Focussing, MALL and the Polynomial Hierarchy (AD0), pp. 689–705.
CSL-2020-Buss0K #branch #complexity #nondeterminism #proving #source code
Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs (SB, AD0, AK), p. 17.
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.