AAAAAA

   
Results: 1-25 | 26-40

Table of contents of journal: *Computational complexity (Print)

Results: 1-25/40
CIRCUITS AND MULTIPARTY PROTOCOLS
Authors: GROLMUSZ V
Citation: V. Grolmusz, CIRCUITS AND MULTIPARTY PROTOCOLS, Computational complexity, 7(1), 1998, pp. 1-18
COMPLEXITY THEORETIC HARDNESS RESULTS FOR QUERY LEARNING
Authors: AIZENSTEIN H HEGEDUS T HELLERSTEIN L PITT L
Citation: H. Aizenstein et al., COMPLEXITY THEORETIC HARDNESS RESULTS FOR QUERY LEARNING, Computational complexity, 7(1), 1998, pp. 19-53
MONADIC LOGICAL DEFINABILITY OF NONDETERMINISTIC LINEAR-TIME
Authors: GRANDJEAN E OLIVE F
Citation: E. Grandjean et F. Olive, MONADIC LOGICAL DEFINABILITY OF NONDETERMINISTIC LINEAR-TIME, Computational complexity, 7(1), 1998, pp. 54-97
WELL-KNOWN BOUND FOR THE VC-DIMENSION MADE EASY
Authors: SMOLENSKY R
Citation: R. Smolensky, WELL-KNOWN BOUND FOR THE VC-DIMENSION MADE EASY, Computational complexity, 6(4), 1997, pp. 299-300
LOWER BOUNDS FOR POLYNOMIAL EVALUATION AND INTERPOLATION PROBLEMS
Authors: SHOUP V SMOLENSKY R
Citation: V. Shoup et R. Smolensky, LOWER BOUNDS FOR POLYNOMIAL EVALUATION AND INTERPOLATION PROBLEMS, Computational complexity, 6(4), 1997, pp. 301-311
THE ELECTRICAL-RESISTANCE OF A GRAPH CAPTURES ITS COMMUTE AND COVER TIMES
Authors: CHANDRA AK RAGHAVAN P RUZZO WL SMOLENSKY R TIWARI P
Citation: Ak. Chandra et al., THE ELECTRICAL-RESISTANCE OF A GRAPH CAPTURES ITS COMMUTE AND COVER TIMES, Computational complexity, 6(4), 1997, pp. 312-340
COLLECTING COUPONS ON TREES, AND THE COVER TIME OF RANDOM-WALKS
Authors: FEIGE U
Citation: U. Feige, COLLECTING COUPONS ON TREES, AND THE COVER TIME OF RANDOM-WALKS, Computational complexity, 6(4), 1997, pp. 341-356
A LOWER-BOUND FOR RANDOMIZED ALGEBRAIC DECISION TREES
Authors: GRIGORIEV D KARPINSKI M AUFDERHEIDE FM SMOLENSKY R
Citation: D. Grigoriev et al., A LOWER-BOUND FOR RANDOMIZED ALGEBRAIC DECISION TREES, Computational complexity, 6(4), 1997, pp. 357-375
RANDOMIZATION AND THE COMPUTATIONAL POWER OF ANALYTIC AND ALGEBRAIC DECISION TREES
Authors: GRIGORIEV D KARPINSKI M SMOLENSKY R
Citation: D. Grigoriev et al., RANDOMIZATION AND THE COMPUTATIONAL POWER OF ANALYTIC AND ALGEBRAIC DECISION TREES, Computational complexity, 6(4), 1997, pp. 376-388
TRIBUTE TO SMOLENSKY,ROMAN
Authors: BORODIN A
Citation: A. Borodin, TRIBUTE TO SMOLENSKY,ROMAN, Computational complexity, 6(3), 1997, pp. 195-198
REPRESENTATIONS OF SETS OF BOOLEAN FUNCTIONS BY COMMUTATIVE RINGS
Authors: SMOLENSKY R
Citation: R. Smolensky, REPRESENTATIONS OF SETS OF BOOLEAN FUNCTIONS BY COMMUTATIVE RINGS, Computational complexity, 6(3), 1997, pp. 199-208
REFLECTIONS ON REPRESENTATIONS OF SETS OF BOOLEAN FUNCTIONS BY COMMUTATIVE RINGS BY SMOLENSKY,ROMAN
Authors: BRUCK J
Citation: J. Bruck, REFLECTIONS ON REPRESENTATIONS OF SETS OF BOOLEAN FUNCTIONS BY COMMUTATIVE RINGS BY SMOLENSKY,ROMAN, Computational complexity, 6(3), 1997, pp. 209-212
EASY LOWER-BOUND FOR A STRANGE COMPUTATIONAL MODEL
Authors: SMOLENSKY R
Citation: R. Smolensky, EASY LOWER-BOUND FOR A STRANGE COMPUTATIONAL MODEL, Computational complexity, 6(3), 1997, pp. 213-216
LOWER BOUNDS ON ARITHMETIC CIRCUITS VIA PARTIAL DERIVATIVES
Authors: NISAN N WIGDERSON A
Citation: N. Nisan et A. Wigderson, LOWER BOUNDS ON ARITHMETIC CIRCUITS VIA PARTIAL DERIVATIVES, Computational complexity, 6(3), 1997, pp. 217-234
UPPER AND LOWER BOUNDS FOR SOME DEPTH-3 CIRCUIT CLASSES
Authors: BEIGEL R MACIEL A
Citation: R. Beigel et A. Maciel, UPPER AND LOWER BOUNDS FOR SOME DEPTH-3 CIRCUIT CLASSES, Computational complexity, 6(3), 1997, pp. 235-255
PROOF COMPLEXITY IN ALGEBRAIC SYSTEMS AND BOUNDED DEPTH FREGE SYSTEMSWITH MODULAR COUNTING
Authors: BUSS S IMPAGLIAZZO R KRAJICEK J PUDLAK P RAZBOROV AA SGALL J
Citation: S. Buss et al., PROOF COMPLEXITY IN ALGEBRAIC SYSTEMS AND BOUNDED DEPTH FREGE SYSTEMSWITH MODULAR COUNTING, Computational complexity, 6(3), 1997, pp. 256-298
ON THE HARDNESS OF COMPUTING THE PERMANENT OF RANDOM MATRICES
Authors: FEIGE U LUND C
Citation: U. Feige et C. Lund, ON THE HARDNESS OF COMPUTING THE PERMANENT OF RANDOM MATRICES, Computational complexity, 6(2), 1997, pp. 101-132
AN AVERAGE COMPLEXITY MEASURE THAT YIELDS TIGHT HIERARCHIES
Authors: REISCHUK R SCHINDELHAUER C
Citation: R. Reischuk et C. Schindelhauer, AN AVERAGE COMPLEXITY MEASURE THAT YIELDS TIGHT HIERARCHIES, Computational complexity, 6(2), 1997, pp. 133-173
SIMPLE LEARNING ALGORITHMS USING DIVIDE-AND-CONQUER
Authors: BSHOUTY NH
Citation: Nh. Bshouty, SIMPLE LEARNING ALGORITHMS USING DIVIDE-AND-CONQUER, Computational complexity, 6(2), 1997, pp. 174-194
UNDIRECTED S-T CONNECTIVITY IN POLYNOMIAL-TIME AND SUBLINEAR SPACE
Authors: BARNES G RUZZO WL
Citation: G. Barnes et Wl. Ruzzo, UNDIRECTED S-T CONNECTIVITY IN POLYNOMIAL-TIME AND SUBLINEAR SPACE, Computational complexity, 6(1), 1996, pp. 1-28
LOWER BOUNDS FOR MONOTONE SPAN PROGRAMS
Authors: BEIMEL A GAL A PATERSON M
Citation: A. Beimel et al., LOWER BOUNDS FOR MONOTONE SPAN PROGRAMS, Computational complexity, 6(1), 1996, pp. 29-45
USING AMPLIFICATION TO COMPUTE MAJORITY WITH SMALL MAJORITY GATES
Authors: GUPTA A MAHAJAN S
Citation: A. Gupta et S. Mahajan, USING AMPLIFICATION TO COMPUTE MAJORITY WITH SMALL MAJORITY GATES, Computational complexity, 6(1), 1996, pp. 46-63
COUNTING CURVES AND THEIR PROJECTIONS
Authors: GATHEN JV KARPINSKI M SHPARLINSKI I
Citation: Jv. Gathen et al., COUNTING CURVES AND THEIR PROJECTIONS, Computational complexity, 6(1), 1996, pp. 64-99
HOW CAN A COMPLEX SQUARE-ROOT BE COMPUTED IN AN OPTIMAL WAY (VOL 5, PG 222, 1995)
Authors: LICKTEIG T WERTHER K
Citation: T. Lickteig et K. Werther, HOW CAN A COMPLEX SQUARE-ROOT BE COMPUTED IN AN OPTIMAL WAY (VOL 5, PG 222, 1995), Computational complexity, 6(1), 1996, pp. 100-100
SUPER-LOGARITHMIC DEPTH LOWER BOUNDS VIA THE DIRECT SUM IN COMMUNICATION COMPLEXITY
Authors: KARCHMER M RAZ R WIGDERSON A
Citation: M. Karchmer et al., SUPER-LOGARITHMIC DEPTH LOWER BOUNDS VIA THE DIRECT SUM IN COMMUNICATION COMPLEXITY, Computational complexity, 5(3-4), 1995, pp. 191-204
Risultati: 1-25 | 26-40