On the public citation graph
Graph isomorphism is low for PP
0 signed · 99 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-10854-8_4openalex-snapshot
Moderately exponential bound for graph isomorphism
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-54458-5_76openalex-snapshot
On the complexity of graph reconstruction
inferredcites →https://doi.org/10.1007/bf00289117openalex-snapshot
The complexity of combinatorial problems with succinct input representation
inferredcites →https://doi.org/10.1007/bf01202284openalex-snapshot
On the power of deterministic reductions to C=P
inferredcites →https://doi.org/10.1007/bfb0028987openalex-snapshot
On the power of parity polynomial time
inferredcites →https://doi.org/10.1007/bfb0036487openalex-snapshot
Two remarks on the power of counting
inferredcites →https://doi.org/10.1016/0020-0190(76)90097-1openalex-snapshot
Relative complexity of checking and evaluating
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(87)90232-8openalex-snapshot
Does co-NP have short interactive proofs?
inferredcites →https://doi.org/10.1016/0020-0190(91)90140-dopenalex-snapshot
Probabilistic polynomial time is closed under parity reductions
inferredcites →https://doi.org/10.1016/0022-0000(82)90009-5openalex-snapshot
Isomorphism of graphs of bounded valence can be tested in polynomial time
inferredcites →https://doi.org/10.1016/0022-0000(82)90015-0openalex-snapshot
Subcomplete generalizations of graph isomorphism
inferredcites →https://doi.org/10.1016/0022-0000(88)90010-4openalex-snapshot
Graph isomorphism is in the low hierarchy
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/0022-0000(92)90022-bopenalex-snapshot
Turing machines with few accepting computations and low sets for PP
inferredcites →https://doi.org/10.1016/0196-6774(85)90012-4openalex-snapshot
The NP-completeness column: an ongoing guide
inferredcites →https://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/0196-6774(86)90038-6openalex-snapshot
A compact representation for permutation groups
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1016/0304-3975(86)90135-0openalex-snapshot
NP is as easy as detecting unique solutions
inferredcites →https://doi.org/10.1016/0304-3975(90)90081-ropenalex-snapshot
Relations among mod-classes
inferredcites →https://doi.org/10.1016/0304-3975(92)90084-sopenalex-snapshot
Counting classes: thresholds, parity, mods, and fewness
inferredcites →https://doi.org/10.1016/s0019-9958(84)80053-4openalex-snapshot
An average case analysis of Floyd's algorithm to construct heaps
inferredcites →https://doi.org/10.1016/s0019-9958(84)80056-xopenalex-snapshot
The complexity of promise problems with applications to public-key cryptography
inferredcites →https://doi.org/10.1109/sct.1989.41826openalex-snapshot
Turning machines with few accepting computations and low sets for PP
inferredcites →https://doi.org/10.1109/sct.1991.160240openalex-snapshot
A complexity theory for feasible closure properties
inferredcites →https://doi.org/10.1109/sct.1991.160241openalex-snapshot
Gap-definable counting classes
inferredcites →https://doi.org/10.1109/sct.1991.160282openalex-snapshot
Degree complexity of Boolean functions and its applications to relativized separations
inferredcites →https://doi.org/10.1109/sfcs.1980.34openalex-snapshot
Polynomial-time algorithms for permutation groups
inferredcites →https://doi.org/10.1109/sfcs.1986.47openalex-snapshot
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
inferredcites →https://doi.org/10.1109/sfcs.1988.21943openalex-snapshot
Fast management of permutation groups
inferredcites →https://doi.org/10.1109/sfcs.1989.63527openalex-snapshot
On the computational power of PP and (+)P
inferredcites →https://doi.org/10.1137/0206049openalex-snapshot
Computational Complexity of Probabilistic Turing Machines
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1137/0220053openalex-snapshot
PP is as Hard as the Polynomial-Time Hierarchy
inferredcites →https://doi.org/10.1145/103418.103435openalex-snapshot
Fast Monte Carlo algorithms for permutation groups
inferredcites →https://doi.org/10.1145/116825.116858openalex-snapshot
Complexity classes defined by counting quantifiers
inferredcites →https://doi.org/10.1145/12130.12137openalex-snapshot
Private coins versus public coins in interactive proof systems
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.1145/800204.806264openalex-snapshot
Computation with permutation groups
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1999.1651openalex-snapshot
Complexity Limitations on Quantum Computation
inferred← citeshttps://doi.org/10.1007/11753728_4openalex-snapshot
SZK Proofs for Black-Box Group Problems
inferred← citeshttps://doi.org/10.1007/3-540-28520-2_6openalex-snapshot
Randomized Algorithms and Complexity Classes
inferred← citeshttps://doi.org/10.1007/3-540-28520-2_8openalex-snapshot
Other Public-Key Cryptosystems and Protocols
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_14openalex-snapshot
Promise problems and access to unambiguous computation
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_48openalex-snapshot
Gap-definability as a closure property
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_9openalex-snapshot
Solvable black-box group problems are low for PP
inferred← citeshttps://doi.org/10.1007/3-540-61863-5_38openalex-snapshot
The complexity of exactly learning algebraic concepts
inferred← citeshttps://doi.org/10.1007/978-0-387-35699-0_12openalex-snapshot
Graph Isomorphism Algorithm by Perfect Matching
inferred← citeshttps://doi.org/10.1007/978-1-4612-1872-2_7openalex-snapshot
The Complexity of Obtaining Solutions for Problems in NP and NL
inferred← citeshttps://doi.org/10.1007/978-3-031-43587-4_17openalex-snapshot
On the Parallel Complexity of Group Isomorphism via Weisfeiler–Leman
inferred← citeshttps://doi.org/10.1007/978-3-032-04700-7_16openalex-snapshot
Complexity of Identifying Fitting-Free Groups
inferred← citeshttps://doi.org/10.1007/978-3-032-22469-9_11openalex-snapshot
Parallel Complexity of Identifying Groups and Quasigroups via Decompositions
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-319-07890-8_6openalex-snapshot
No Easy Puzzles: A Hardness Result for Jigsaw Puzzles
inferred← citeshttps://doi.org/10.1007/978-3-319-40970-2_3openalex-snapshot
Solution-Graphs of Boolean Formulas and Isomorphism
inferred← citeshttps://doi.org/10.1007/978-3-540-27798-9_22openalex-snapshot
Learning DNFs and Circuits Using Teaching Assistants
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-642-30287-9_24openalex-snapshot
The Explanatory Power of Relations and an Application to an Economic Network
inferred← citeshttps://doi.org/10.1007/bf01578845openalex-snapshot
On the complexity of graph reconstruction
inferred← citeshttps://doi.org/10.1007/bfb0058033openalex-snapshot
Improved lowness results for solvable black-box group problems
inferred← citeshttps://doi.org/10.1007/s00037-020-00197-5openalex-snapshot
The Robustness of LWPP and WPP, with an Application to Graph Reconstruction
inferred← citeshttps://doi.org/10.1007/s00224-001-1048-9openalex-snapshot
Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones
inferred← citeshttps://doi.org/10.1007/s00224-007-9028-3openalex-snapshot
SZK Proofs for Black-Box Group Problems
inferred← citeshttps://doi.org/10.1007/springerreference_65706openalex-snapshot
Schema Evolution in Process Management Systems
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00104-qopenalex-snapshot
Realizability and uniqueness in graphs
inferred← citeshttps://doi.org/10.1016/j.is.2005.05.001openalex-snapshot
Contextualization as an independent abstraction mechanism for conceptual modeling
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103703openalex-snapshot
On the parallel complexity of group isomorphism via Weisfeiler–Leman
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.02.030openalex-snapshot
No easy puzzles: Hardness results for jigsaw puzzles
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80024-8openalex-snapshot
Gap-definable counting classes
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00100-4openalex-snapshot
Solvable black-box group problems are low for PP
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00218-7openalex-snapshot
The counting complexity of group-definable languages
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00018-xopenalex-snapshot
An oracle builder’s toolkit
inferred← citeshttps://doi.org/10.1023/a:1011235419951openalex-snapshot
Automatic Real-Time Analysis of Reactive Systems with the PARTS Toolset
inferred← citeshttps://doi.org/10.1038/s41534-019-0156-9openalex-snapshot
The computational landscape of general physical theories
inferred← citeshttps://doi.org/10.1093/bib/bby078openalex-snapshot
Binding site matching in rational drug design: algorithms and applications
inferred← citeshttps://doi.org/10.1109/icis.2009.66openalex-snapshot
Solving Global Unconstrained Optimization Problems by Symmetry-Breaking
inferred← citeshttps://doi.org/10.1109/sct.1995.514863openalex-snapshot
On the structure of low sets [complexity classes]
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181999openalex-snapshot
Graph isomorphism is in SPP
inferred← citeshttps://doi.org/10.1109/tcad.2003.816218openalex-snapshot
Solving difficult instances of boolean satisfiability in the presence of symmetry
inferred← citeshttps://doi.org/10.1137/s0097539703420651openalex-snapshot
Counting Complexity of Solvable Black-Box Group Problems
inferred← citeshttps://doi.org/10.1142/s0218196724500103openalex-snapshot
Count-free Weisfeiler–Leman and group isomorphism
inferred← citeshttps://doi.org/10.1145/592642.592646openalex-snapshot
Some facets of complexity theory and cryptography
inferred← citeshttps://doi.org/10.4204/eptcs.390.12openalex-snapshot
On the Descriptive Complexity of Groups without Abelian Normal Subgroups (Extended Abstract)
inferred← citeshttps://doi.org/10.4230/lipics.rta.2013.255openalex-snapshot
Algorithms for Extended Alpha-Equivalence and Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.0712.0142openalex-snapshot
The Algebra of Graph Invariants - Lower and Upper Bounds for Minimal Generators
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.2106.13520openalex-snapshot
Complexity of Deciding Syntactic Equivalence up to Renaming for Term Rewriting Systems (Extended Version)
inferred← citeshttps://doi.org/10.48550/arxiv.math/0607770openalex-snapshot
The graph isomorphism problem is polynomial
inferred← citeshttps://doi.org/10.7907/s1r0-0v87.openalex-snapshot
Investigations in quantum computing: causality and graph isomorphism
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.