-
1
-
2
-
3
Boolean circuits, tensor ranks and communication complexity.
Argitaratua izan da SIAM journal on computing.Artikulua -
4
On the complexity of finding a minimum cycle cover of a graph.
Argitaratua izan da SIAM journal on computing.Artikulua -
5
An optimal algorithm for scanning all spanning trees of undirected graphs.
Argitaratua izan da SIAM journal on computing.Artikulua -
6
Size-depth tradeoffs for threshold circuits.
Argitaratua izan da SIAM journal on computing.Artikulua -
7
Bounds for the computational power and learning complexity of analog neural nets.
Argitaratua izan da SIAM journal on computing.Artikulua -
8
On the amount of nondeterminism and the power of nondeterminism and the power of verifying.
Argitaratua izan da SIAM journal on computing.Artikulua -
9
Bounds on the number of examples needed for learning functions.
Argitaratua izan da SIAM journal on computing.Artikulua -
10