Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
WoLLIC
/
Paper
A Characterisation of Definable NP Search Problems in Peano Arithmetic.
Arnold Beckmann
Venue
C
WoLLIC
Year
2009
Proceedings
WoLLIC
DBLP record
conf/wollic/Beckmann09 ↗
Browse the full
WoLLIC paper archive
.