Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
TARK
/
Paper
Logical omniscience as a computational complexity problem.
Sergei N. Artmov
,
Roman Kuznets
Venue
B
TARK
Year
2009
Proceedings
TARK
DBLP record
conf/tark/ArtemovK09 ↗
Browse the full
TARK paper archive
.