Raymond Greenlaw, H. James Hoover, Walter L. Ruzzo  Home/Search
Context Related
| armstrong.edu/greenlaw/res...limits.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: armstrong.edu/greenlaw/re...books (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: D. Kavadias, L. M. Kirousis, and P. G. Spirakis. The complexity of the reliable connectivity problem. Information Processing Letters, 39(5):245--252, 13 September 1991. (135) [206] P. Kelsen. On computing a maximal independent set in a hypergraph of constant dimension in parallel. In Proceedings of the TwentyFourth Annual ACM Symposium on Theory of Computing, pages 339--369, Victoria, B.C., Canada, May 1992. (225) [207] L. G. Khachian. A polynomial time algorithm for linear programming.... (Update)
Cited by: More
Combinatorial Games: Selected Bibliography with a Succinct.. - Fraenkel (2006) (Correct)
The Complexity of XPath Query Evaluation - Georg Gottlob Database (2003) (Correct)
P-completeness of cellular automaton Rule 110 - Neary, Woods (2006) (Correct)
Similar documents (at the sentence level):
9.5%: A Compendium of Problems Complete for P - Greenlaw, Hoover, Ruzzo (1991) (Correct)
Active bibliography (related documents): More All
0.5: Convergence Properties of Optimization Algorithms for the.. - Gu, Gu, Du (Correct)
0.3: A Survey of Fast Exponentiation Methods - Gordon (1998) (Correct)
0.2: On the Power of White Pebbles - Kalyanasundaram, Schnitger (1998) (Correct)
Similar documents based on text: More All
0.3: The Computational Complexity of Generating Random Fractals - Machta, Greenlaw (1996) (Correct)
0.2: Application Framework Issues when Evolving Business.. - Froehlich, Hoover.. (1999) (Correct)
Related documents from co-citation: More All
31: Computational Complexity (context) - Papadimitriou - 1994
13: A Catalog of Complexity Classes (context) - Johnson - 1990
12: Parallel algorithms for shared-memory machines (context) - Karp, Ramachandran - 1990
BibTeX entry: (Update)
R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. Limits to Parallel Computation: P-Completeness Theory, Oxford University Press, 1995. http://citeseer.ist.psu.edu/greenlaw95limits.html More
@book{ greenlaw95limits,
author = "R. Greenlaw and H. J. Hoover and W. L. Ruzzo",
title = "Limits to Parallel Computation: ${P}$-Completeness Theory",
publisher = "Oxford University Press",
year = "1995",
url = "citeseer.ist.psu.edu/greenlaw95limits.html" }
Citations (may not include all citations):34 Improving the performance guarantee for approximate graph co.. (context) - Wigderson - 1983 ACM DBLP
17 On parallel computational complexity of unification (context) - Yasuura DBLP
11 Feedback vertex sets and cyclically reducible graphs (context) - Wang, Lloyd et al. - 1985 ACM DBLP
9 Parallel algorithms for algebraic problems (context) - Gathen - 1984 ACM DBLP
4 White pebbles help (context) - Wilber - 1988 ACM DBLP
3 Computing powers in parallel (context) - Gathen - 1987 ACM DBLP
2 Computers for Artificial Intelligence Applications (context) - Wah, Li - 1986 ACM
1 cient parallelization of equivalence checking algorithms (context) - Zhang, Smolka
1 The reachability problem on directed hypergraphs and computa.. (context) - Yasuura - 1983
1 Computing large polynomial powers very fast in parallel (context) - Zeugmann ACM DBLP
1 Highly parallel computations modulo a number having only sma.. (context) - Zeugmann - 1992 ACM DBLP
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC