Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
Hardness of approximate two-level logic minimization and PAC learning with membership queries.
Vitaly Feldman
Venue
A*
STOC
Year
2006
Proceedings
STOC
DBLP record
conf/stoc/Feldman06 ↗
Browse the full
STOC paper archive
.