AAAAAA

   
Results: 1-15 |
Results: 15
MONOTONE CIRCUITS FOR CONNECTIVITY HAVE DEPTH (LOG N)(2-O(1))
Authors: GOLDMANN M HASTAD J
Citation: M. Goldmann et J. Hastad, MONOTONE CIRCUITS FOR CONNECTIVITY HAVE DEPTH (LOG N)(2-O(1)), SIAM journal on computing, 27(5), 1998, pp. 1283-1294
CIRCUIT BOTTOM FAN-IN AND COMPUTATIONAL POWER
Authors: CAI LM CHE JN HASTAD J
Citation: Lm. Cai et al., CIRCUIT BOTTOM FAN-IN AND COMPUTATIONAL POWER, SIAM journal on computing, 27(2), 1998, pp. 341-355
THE SHRINKAGE EXPONENT OF DE MORGAN FORMULAS IS 2
Authors: HASTAD J
Citation: J. Hastad, THE SHRINKAGE EXPONENT OF DE MORGAN FORMULAS IS 2, SIAM journal on computing, 27(1), 1998, pp. 48-64
ON THE COMPLEXITY OF INTERACTIVE PROOFS WITH BOUNDED COMMUNICATION
Authors: GOLDREICH O HASTAD J
Citation: O. Goldreich et J. Hastad, ON THE COMPLEXITY OF INTERACTIVE PROOFS WITH BOUNDED COMMUNICATION, Information processing letters, 67(4), 1998, pp. 205-214
ANALYSIS OF BACKOFF PROTOCOLS FOR MULTIPLE-ACCESS CHANNELS
Authors: HASTAD J LEIGHTON T ROGOFF B
Citation: J. Hastad et al., ANALYSIS OF BACKOFF PROTOCOLS FOR MULTIPLE-ACCESS CHANNELS, SIAM journal on computing, 25(4), 1996, pp. 740-774
LINEARITY TESTING IN CHARACTERISTIC-2
Authors: BELLARE M COPPERSMITH D HASTAD J KIWI M SUDAN M
Citation: M. Bellare et al., LINEARITY TESTING IN CHARACTERISTIC-2, IEEE transactions on information theory, 42(6), 1996, pp. 1781-1795
TOP-DOWN LOWER BOUNDS FOR DEPTH-3 CIRCUITS
Authors: HASTAD J JUKNA S PUDLAK P
Citation: J. Hastad et al., TOP-DOWN LOWER BOUNDS FOR DEPTH-3 CIRCUITS, Computational complexity, 5(2), 1995, pp. 99-112
ON THE SHRINKAGE EXPONENT FOR READ-ONCE FORMULAS
Authors: HASTAD J RAZBOROV A YAO A
Citation: J. Hastad et al., ON THE SHRINKAGE EXPONENT FOR READ-ONCE FORMULAS, Theoretical computer science, 141(1-2), 1995, pp. 269-282
ON THE SIZE OF WEIGHTS FOR THRESHOLD GATES
Authors: HASTAD J
Citation: J. Hastad, ON THE SIZE OF WEIGHTS FOR THRESHOLD GATES, SIAM journal on discrete mathematics, 7(3), 1994, pp. 484-492
OPTIMAL DEPTH, VERY SMALL-SIZE CIRCUITS FOR SYMMETRICAL FUNCTIONS IN AC(0)
Authors: HASTAD J WEGENER I WURM N YI SZ
Citation: J. Hastad et al., OPTIMAL DEPTH, VERY SMALL-SIZE CIRCUITS FOR SYMMETRICAL FUNCTIONS IN AC(0), Information and computation, 108(2), 1994, pp. 200-211
THE RANDOM ORACLE HYPOTHESIS IS FALSE
Authors: CHANG R CHOR B GOLDREICH O HARTMANIS J HASTAD J RANJAN D ROHATGI P
Citation: R. Chang et al., THE RANDOM ORACLE HYPOTHESIS IS FALSE, Journal of computer and system sciences, 49(1), 1994, pp. 24-39
ON AVERAGE TIME HIERARCHIES
Authors: GOLDMANN M GRAPE P HASTAD J
Citation: M. Goldmann et al., ON AVERAGE TIME HIERARCHIES, Information processing letters, 49(1), 1994, pp. 15-20
THE DISCRETE LOGARITHM MODULO A COMPOSITE HIDES O(N) BITS
Authors: HASTAD J SCHRIFT AW SHAMIR A
Citation: J. Hastad et al., THE DISCRETE LOGARITHM MODULO A COMPOSITE HIDES O(N) BITS, Journal of computer and system sciences, 47(3), 1993, pp. 376-404
A WELL-CHARACTERIZED APPROXIMATION PROBLEM
Authors: HASTAD J PHILLIPS S SAFRA S
Citation: J. Hastad et al., A WELL-CHARACTERIZED APPROXIMATION PROBLEM, Information processing letters, 47(6), 1993, pp. 301-305
A SIMPLE LOWER BOUND FOR MONOTONE CLIQUE USING A COMMUNICATION GAME
Authors: GOLDMANN M HASTAD J
Citation: M. Goldmann et J. Hastad, A SIMPLE LOWER BOUND FOR MONOTONE CLIQUE USING A COMMUNICATION GAME, Information processing letters, 41(4), 1992, pp. 221-226
Risultati: 1-15 |