Toggle navigation
Home
People
Departments
Research
About
Login
Search
Feasible Proofs of Szpilrajn's Theorem - A Proof-Complexity Framework for Concurrent Automata.
Journal Articles
Overview
Identity
Additional Document Info
View All
Overview
authors
Soltys, Michael
publication date
2011
published in
J. Autom. Lang. Comb.
Journal
Identity
Digital Object Identifier (DOI)
10.25596/jalc-2011-037
Additional Document Info
start page
37
end page
48
volume
16