-
1
-
2
-
3
Boolean circuits, tensor ranks and communication complexity.
Pubblicato in SIAM journal on computing.Articolo -
4
On the complexity of finding a minimum cycle cover of a graph.
Pubblicato in SIAM journal on computing.Articolo -
5
-
6
-
7
-
8
-
9
Bounds on the number of examples needed for learning functions.
Pubblicato in SIAM journal on computing.Articolo -
10