-
1
-
2
-
3
Boolean circuits, tensor ranks and communication complexity.
Опубликовано в: SIAM journal on computing.Статья -
4
On the complexity of finding a minimum cycle cover of a graph.
Опубликовано в: SIAM journal on computing.Статья -
5
-
6
-
7
-
8
-
9
Bounds on the number of examples needed for learning functions.
Опубликовано в: SIAM journal on computing.Статья -
10