Learning boolean formulae or finite automata is as hard as factoring

uncertainty in artificial intelligence,2002, 引用: 6

,2014, 引用: 22

,2010, 引用: 18

,2004, 引用: 10

,2015, 引用: 5,763

,1989, 引用: 9

european conference on computational learning theory,1999, 引用: 175

conference on learning theory,2007, 引用: 4

Lecture Notes in Computer Science,2006, 引用: 7

european conference on computer vision,2004, 引用: 73