Skip to content
cs-conference-ranking.org

On the Complexity of Learning Minimum Time-Bounded Turing Machines.

Ker-I Ko

VenueA*COLT
Year1990
ProceedingsCOLT
DBLP recordconf/colt/Ko90 ↗

Browse the full COLT paper archive.