Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
An exponential lower bound for individualization-refinement algorithms for graph isomorphism.
Daniel Neuen
,
Pascal Schweitzer
Venue
A*
STOC
Year
2018
Proceedings
STOC
DBLP record
conf/stoc/NeuenS18 ↗
Browse the full
STOC paper archive
.