-
1
-
2
-
3
-
4
-
5
Boolean circuits, tensor ranks and communication complexity.
I publikationen SIAM journal on computing.Artikel -
6
On the complexity of finding a minimum cycle cover of a graph.
I publikationen SIAM journal on computing.Artikel -
7
An optimal algorithm for scanning all spanning trees of undirected graphs.
I publikationen SIAM journal on computing.Artikel -
8
-
9
-
10