IMPROVED PROCESSOR BOUNDS FOR COMBINATORIAL PROBLEMS IN RNC

被引：12
作者：
GALIL, Z
PAN, V
机构：
[1] COLUMBIA UNIV,DEPT COMP SCI,NEW YORK,NY 10027
[2] COLUMBIA UNIV,DEPT COMP SCI,NEW YORK,NY 10027
[3] TEL AVIV UNIV,IL-69978 TEL AVIV,ISRAEL
来源：
COMBINATORICA | 1988年 / 8卷 / 02期
关键词：
D O I：
10.1007/BF02122800
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：189 / 200
页数：12
相关论文
共 16 条
[1]   ON COMPUTING THE DETERMINANT IN SMALL PARALLEL TIME USING A SMALL NUMBER OF PROCESSORS [J].
BERKOWITZ, SJ .
INFORMATION PROCESSING LETTERS, 1984, 18 (03) :147-150
[2]   FAST PARALLEL MATRIX AND GCD COMPUTATIONS [J].
BORODIN, A ;
GATHEN, JV ;
HOPCROFT, J .
INFORMATION AND CONTROL, 1982, 52 (03) :241-256
[3]   PARALLEL COMPUTATION FOR WELL-ENDOWED RINGS AND SPACE-BOUNDED PROBABILISTIC MACHINES [J].
BORODIN, A ;
COOK, S ;
PIPPENGER, N .
INFORMATION AND CONTROL, 1983, 58 (1-3) :113-136
[4]  
BRODER A, 1985, COMMUNICATION
[5]  
GABOW H, 1985, COMMUNICATION
[6]  
KARP RM, 1985, 17TH P ANN ACM S THE, P22
[7]  
Marcus M., 1964, SURVEY MATRIX THEORY
[8]   MATCHING IS AS EASY AS MATRIX-INVERSION [J].
MULMULEY, K ;
VAZIRANI, UV ;
VAZIRANI, VV .
COMBINATORICA, 1987, 7 (01) :105-113
[9]  
PAN V, 1985, 5TH P C SOFTW TECHN, V206, P504
[10]  
PAN V, 1987, IN PRESS THEORETICAL, V54
12