AAAAAA

   
Results: 1-6 |
Results: 6
CIRCUITS AND MULTIPARTY PROTOCOLS
Authors: GROLMUSZ V
Citation: V. Grolmusz, CIRCUITS AND MULTIPARTY PROTOCOLS, Computational complexity, 7(1), 1998, pp. 1-18
A LOWER-BOUND FOR DEPTH-3 CIRCUITS WITH MOD M-GATES
Authors: GROLMUSZ V
Citation: V. Grolmusz, A LOWER-BOUND FOR DEPTH-3 CIRCUITS WITH MOD M-GATES, Information processing letters, 67(2), 1998, pp. 87-90
ON THE POWER OF CIRCUITS WITH GATES OF LOW L-1 NORMS
Authors: GROLMUSZ V
Citation: V. Grolmusz, ON THE POWER OF CIRCUITS WITH GATES OF LOW L-1 NORMS, Theoretical computer science, 188(1-2), 1997, pp. 117-128
ON THE WEAK MOD-M REPRESENTATION OF BOOLEAN FUNCTIONS
Authors: GROLMUSZ V
Citation: V. Grolmusz, ON THE WEAK MOD-M REPRESENTATION OF BOOLEAN FUNCTIONS, Chicago journal of theoretical computer science, 1(2), 1995, pp. 1-8
SEPARATING THE COMMUNICATION COMPLEXITIES OF MOD-M AND MOD-P CIRCUITS
Authors: GROLMUSZ V
Citation: V. Grolmusz, SEPARATING THE COMMUNICATION COMPLEXITIES OF MOD-M AND MOD-P CIRCUITS, Journal of computer and system sciences, 51(2), 1995, pp. 307-313
THE BNS LOWER-BOUND FOR MULTIPARTY PROTOCOLS IS NEARLY OPTIMAL
Authors: GROLMUSZ V
Citation: V. Grolmusz, THE BNS LOWER-BOUND FOR MULTIPARTY PROTOCOLS IS NEARLY OPTIMAL, Information and computation, 112(1), 1994, pp. 51-54
Risultati: 1-6 |