Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
LICS
/
Paper
On the Computational Complexity of Cut-Reduction.
Klaus Aehlig
,
Arnold Beckmann
Venue
A*
LICS
Year
2008
Proceedings
LICS
DBLP record
conf/lics/AehligB08 ↗
Browse the full
LICS paper archive
.