V. Arvind, Jacobo Torán  Home/Search
Context
Related
| imsc.ernet.in/~arvind/dl...ginter.ps.gz 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: imsc.ernet.in/~arvind/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We design a nonadaptive NC checker for permutation group intersection, sharpening a result of Blum and Kannan [4]. Additionally, we also get nonadaptive NC checkers for some related group-theoretic problems. Keywords: program checking, interactive proofs, polynomial time. 1. Introduction We design nonadaptive parallel program checkers for certain permutation group-theoretic problems. As defined by Blum and Kannan in [4], a program checker for a problem takes a purported program P for that... (Update)
Similar documents (at the sentence level):
44.7%: A Nonadaptive NC Checker for Permutation Group Intersection - Arvind, Torán (1996) (Correct)
Active bibliography (related documents): More All
0.2: Algorithms for Matrix Groups and the Tits Alternative - Beals (1999) (Correct)
0.2: Computing in Quotient Groups - Kantor, Luks (1990) (Correct)
0.2: Computing the Composition Factors of a Permutation Group in.. - Luks (1987) (Correct)
Similar documents based on text: More All
0.5: The Complexity of Modular Graph - Automorphism Arvind Beigel (Correct)
0.5: Solvable Group Isomorphism is (Almost) in NP ∩ coNP - Arvind, Toran (2003) (Correct)
0.3: The Complexity of Modular Graph Automorphism - Arvind Beigel (1982) (Correct)
BibTeX entry: (Update)
@article{ arvind01nonadaptive,
author = "V. Arvind and Jacobo Tor{\'a}n",
title = "A nonadaptive {NC} checker for permutation group intersection",
journal = "Theoretical Computer Science",
volume = "259",
number = "1--2",
pages = "597--611",
year = "2001",
url = "citeseer.ist.psu.edu/arvind97nonadaptive.html" }
Citations (may not include all citations):951 Computational Complexity (context) - Papadimitriou - 1994
474 Graph Theory (context) - Harary - 1969
192 Designing programs that check their work - Blum, Kannan - 1995
98 EATCS Monographs on Theoretical Computer Science (context) - Balc'azar, D'iaz et al. - 1989
92 correcting with applications to numerical problems (context) - Blum, Luby et al. - 1993
82 The Theory of Groups (context) - Hall - 1959
65 Journal of ACM (context) - Shamir, PSPACE - 1992
49 Isomorphism of graphs of bounded valence can be tested in po.. (context) - Luks - 1982
40 Arithmetization: a new method in structural complexity theor.. - Babai, Fortnow - 1991
39 Polynomial time algorithms for permutation groups (context) - Furst, Hopcroft et al. - 1980
29 Group-Theoretic Algorithms and Graph Isomorphism (context) - Hoffmann - 1982
22 Computational methods in the study of permutation groups (context) - Sims - 1970
22 Locally random reductions in interactive complexity - Feigenbaum - 1993
18 Permutation Groups in NC (context) - Babai, Luks et al. - 1987
17 Efficient checkers for number-theoretic computations (context) - Adleman, Huang et al. - 1995
15 Monte Carlo algorithms in graph isomorphism testing (context) - Babai - 1979
13 the nonuniform complexity of the graph isomorphism problem (context) - Lozano, Tor'an - 1992
13 Permutation groups and polynomial-time computation (context) - Luks - 1993
8 Personal communication (context) - Fortnow, Kannan et al. - 1993
2 Graph Isomorphism: its Structural Complexity (context) - obler, oning et al. - 1992
Documents on the same site (http://www.imsc.ernet.in/~arvind/): More
Nondeterministic Instance Complexity and.. - Arvind, Köbler.. (Correct)
Sparse Sets, Approximable Sets, and Parallel Queries to NP - Arvind, Torán (Correct)
Exact Learning via Teaching Assistants (Extended Abstract) - Arvind, al. (Correct)
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