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