On the public citation graph
Graph isomorphism is in the low hierarchy
0 signed · 66 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-11493-9openalex-snapshot
Group-Theoretic Algorithms and Graph Isomorphism
inferredcites →https://doi.org/10.1007/3-540-16486-3_112openalex-snapshot
Probabilistic quantifiers, adversaries, and complexity classes : An overview
inferredcites →https://doi.org/10.1007/bfb0016291openalex-snapshot
Proofs that Release Minimum Knowledge
inferredcites →https://doi.org/10.1016/0020-0190(79)90004-8openalex-snapshot
A note on the graph isomorphism counting problem
inferredcites →https://doi.org/10.1016/0020-0190(83)90044-3openalex-snapshot
BPP and the polynomial hierarchy
inferredcites →https://doi.org/10.1016/0020-0190(87)90232-8openalex-snapshot
Does co-NP have short interactive proofs?
inferredcites →https://doi.org/10.1016/0022-0000(79)90044-8openalex-snapshot
Universal classes of hash functions
inferredcites →https://doi.org/10.1016/0022-0000(83)90027-2openalex-snapshot
A low and a high hierarchy within NP
inferredcites →https://doi.org/10.1016/0022-0000(88)90028-1openalex-snapshot
Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
inferredcites →https://doi.org/10.1016/0304-3975(76)90061-xopenalex-snapshot
The polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0304-3975(80)90027-4openalex-snapshot
On counting problems and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0304-3975(82)90085-8openalex-snapshot
Strong nondeterministic polynomial-time reducibilities
inferredcites →https://doi.org/10.1016/s0019-9958(86)80044-4openalex-snapshot
A decisive characterization of BPP
inferredcites →https://doi.org/10.1137/0206049openalex-snapshot
Computational Complexity of Probabilistic Turing Machines
inferredcites →https://doi.org/10.1137/0210008openalex-snapshot
Relative to a Random Oracle A , ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
inferredcites →https://doi.org/10.1137/0214003openalex-snapshot
On Circuit-Size Complexity and the Low Hierarchy in NP
inferredcites →https://doi.org/10.1145/12130.12137openalex-snapshot
Private coins versus public coins in interactive proof systems
inferredcites →https://doi.org/10.1145/22145.22192openalex-snapshot
Trading group theory for randomness
inferredcites →https://doi.org/10.1145/800061.808762openalex-snapshot
A complexity theoretic approach to randomness
inferredcites →https://doi.org/10.1145/800105.803405openalex-snapshot
Reducibility, randomness, and intractibility (Abstract)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-18625-5_67openalex-snapshot
Probabilistic quantifiers vs. distrustful adversaries
inferred← citeshttps://doi.org/10.1007/3-540-56944-8_46openalex-snapshot
A first order resolution calculus with symmetries
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_168openalex-snapshot
Hardness of approximating graph transformation problem
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_27openalex-snapshot
Isomorphic Unordered Labeled Trees up to Substitution Ciphering
inferred← citeshttps://doi.org/10.1007/978-3-319-05446-9_11openalex-snapshot
Permutation Groups and the Graph Isomorphism Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_26openalex-snapshot
Representing Groups on Graphs
inferred← citeshttps://doi.org/10.1007/978-3-7091-1797-2_9openalex-snapshot
Privacy and Ethical Issues in Social Network Analysis
inferred← citeshttps://doi.org/10.1007/bfb0030875openalex-snapshot
Structure in Approximation Classes
inferred← citeshttps://doi.org/10.1007/s00037-007-0219-8openalex-snapshot
Complexity of Ring Morphism Problems
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90232-8openalex-snapshot
Does co-NP have short interactive proofs?
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(88)90033-8openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90185-5openalex-snapshot
Nonuniform proof systems: a new framework to describe nonuniform and probabilistic complexity classes
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90354-5openalex-snapshot
On computational complexity and honest polynomial degrees
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90002-jopenalex-snapshot
Separating the low and high hierachies by oracles
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50007-2openalex-snapshot
A Catalog of Complexity Classes
inferred← citeshttps://doi.org/10.1016/j.cosrev.2011.09.002openalex-snapshot
Confronting intractability via parameters
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80206-3openalex-snapshot
Chapter 9 Computational complexity
inferred← citeshttps://doi.org/10.1017/s0963548300001553openalex-snapshot
On the Hardness of Approximating Some Optimization Problems That Are Supposedly Easier Than MAX CLIQUE
inferred← citeshttps://doi.org/10.1088/1751-8113/48/26/265301openalex-snapshot
Phase-modified CTQW unable to distinguish strongly regular graphs efficiently
inferred← citeshttps://doi.org/10.1109/icegic.2009.5293609openalex-snapshot
A secure and efficient micropayment solution for online gaming
inferred← citeshttps://doi.org/10.1109/sct.1989.41832openalex-snapshot
On the structure of bounded queries to arbitrary NP sets
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181999openalex-snapshot
Graph isomorphism is in SPP
inferred← citeshttps://doi.org/10.1137/0221045openalex-snapshot
On the Structure of Bounded Queries to Arbitrary NP Sets
inferred← citeshttps://doi.org/10.1137/s0097539796304220openalex-snapshot
Structure in Approximation Classes
inferred← citeshttps://doi.org/10.1145/116825.116852openalex-snapshot
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
inferred← citeshttps://doi.org/10.1145/1456223.1456241openalex-snapshot
Extending web applications with a lightweight zero knowledge proof authentication
inferred← citeshttps://doi.org/10.1145/2488608.2488613openalex-snapshot
On the complexity of trial and error
inferred← citeshttps://doi.org/10.12794/metadc12076openalex-snapshot
An investigation into graph isomorphism based zero-knowledge proofs.
inferred← citeshttps://doi.org/10.2307/2584070openalex-snapshot
Introduction to the Theory of Complexity.
inferred← citeshttps://doi.org/10.26083/tuprints-00000610openalex-snapshot
Strukturelle Analyse Web-basierter Dokumente
inferred← citeshttps://doi.org/10.48550/arxiv.0801.4911openalex-snapshot
On the Double Coset Membership Problem for Permutation Groups
inferred← citeshttps://doi.org/10.48550/arxiv.1011.4138openalex-snapshot
Quantum Algorithms for Tree Isomorphism and State Symmetrization
inferred← citeshttps://doi.org/10.48550/arxiv.1101.5211openalex-snapshot
The Weisfeiler-Lehman Method and Graph Isomorphism Testing
inferred← citeshttps://doi.org/10.48550/arxiv.1604.08558openalex-snapshot
Polynomial-time kernel reductions
inferred← citeshttps://doi.org/10.70675/bf33c9f6z92fcz4edcza31bz68cbd82b24bdopenalex-snapshot
On the similarities of trees : the interest of enumeration and compression methods
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.