On the public citation graph
Boolean Functions, Invariance Groups, and Parallel Complexity
0 signed · 51 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.1002/j.1538-7305.1949.tb03624.xopenalex-snapshot
The Synthesis of Two-Terminal Switching Circuits
inferredcites →https://doi.org/10.1002/j.1538-7305.1956.tb03836.xopenalex-snapshot
Detection of Group Invariance or Total Symmetry of a Boolean Function*
inferredcites →https://doi.org/10.1007/978-1-4612-4664-0openalex-snapshot
Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds
inferredcites →https://doi.org/10.1007/978-1-4613-9595-9openalex-snapshot
An Introduction to Formal Language Theory
inferredcites →https://doi.org/10.1007/bf00191933openalex-snapshot
A survey of the maximal subgroups of the finite simple groups
inferredcites →https://doi.org/10.1007/bf01744431openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1007/bfb0040392openalex-snapshot
Applying the classification theorem for finite simple groups to minimize pin count in uniform permutation architectures
inferredcites →https://doi.org/10.1016/0001-8708(79)90034-3openalex-snapshot
The theory of error-correcting codes
inferredcites →https://doi.org/10.1016/0304-3975(85)90045-3openalex-snapshot
Bounded-depth, polynomial-size circuits for symmetric functions
inferredcites →https://doi.org/10.1016/s0019-9958(85)80041-3openalex-snapshot
A taxonomy of problems with fast parallel algorithms
inferredcites →https://doi.org/10.1017/s144678870003216xopenalex-snapshot
On the O'Nan-Scott theorem for finite primitive permutation groups
inferredcites →https://doi.org/10.1109/sfcs.1980.34openalex-snapshot
Polynomial-time algorithms for permutation groups
inferredcites →https://doi.org/10.1137/0112026openalex-snapshot
On the Classification of Boolean Functions by the General Linear and Affine Groups
inferredcites →https://doi.org/10.1137/0213027openalex-snapshot
Simulation of Parallel Random Access Machines by Circuits
inferredcites →https://doi.org/10.4153/cjm-1955-005-xopenalex-snapshot
Set-Transitive 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.1002/jgt.22808openalex-snapshot
Wreath product in automorphism groups of graphs
inferred← citeshttps://doi.org/10.1006/jabr.1997.7198openalex-snapshot
Symmetry Groups of Boolean Functions and Constructions of Permutation Groups
inferred← citeshttps://doi.org/10.1007/3-540-61377-3_36openalex-snapshot
A note on the relation between polynomial time functionals and Constable's class K
inferred← citeshttps://doi.org/10.1007/s00224-016-9692-2openalex-snapshot
On Symmetric Circuits and Fixed-Point Logics
inferred← citeshttps://doi.org/10.1007/s00224-021-10029-wopenalex-snapshot
Computing the Number of Affine Equivalent Classes on $\mathcal {R}(s,n)/\mathcal {R}(k,n)$
inferred← citeshttps://doi.org/10.1007/s00373-019-02096-1openalex-snapshot
Cyclic Permutation Groups that are Automorphism Groups of Graphs
inferred← citeshttps://doi.org/10.1007/s00500-016-2084-3openalex-snapshot
Cut approach to invariance groups of lattice-valued functions
inferred← citeshttps://doi.org/10.1007/s100920050014openalex-snapshot
Harmonic analysis and Boolean function complexity
inferred← citeshttps://doi.org/10.1007/s10801-022-01214-2openalex-snapshot
Orbit closed permutation groups, relation groups, and simple groups
inferred← citeshttps://doi.org/10.1007/s10992-026-09846-6openalex-snapshot
Symmetry Groups of Boolean Self-referential Systems
inferred← citeshttps://doi.org/10.1007/s13366-020-00525-4openalex-snapshot
Invariance groups of functions and related Galois connections
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90154-nopenalex-snapshot
Almost all boolean functions have no linear symmetries
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00070-3openalex-snapshot
Labeled versus unlabeled distributed Cayley networks
inferred← citeshttps://doi.org/10.1016/j.dam.2005.02.008openalex-snapshot
Linear symmetries of Boolean functions
inferred← citeshttps://doi.org/10.1016/j.disc.2010.06.036openalex-snapshot
Regular symmetric groups of boolean functions
inferred← citeshttps://doi.org/10.1016/j.ejc.2014.01.011openalex-snapshot
Symmetry groups of boolean functions
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104921openalex-snapshot
Isomorphism testing of read-once functions and polynomials
inferred← citeshttps://doi.org/10.1016/j.mathsocsci.2024.07.004openalex-snapshot
Symmetry groups for social preference functions
inferred← citeshttps://doi.org/10.1023/a:1005769927571openalex-snapshot
Universal Affine Classification of Boolean Functions
inferred← citeshttps://doi.org/10.1109/ccc.2012.28openalex-snapshot
Junto-Symmetric Functions, Hypergraph Isomorphism and Crunching
inferred← citeshttps://doi.org/10.1109/focs.2012.53openalex-snapshot
Partially Symmetric Functions Are Efficiently Isomorphism-Testable
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548501openalex-snapshot
The Boolean isomorphism problem
inferred← citeshttps://doi.org/10.1137/140971877openalex-snapshot
Partially Symmetric Functions Are Efficiently Isomorphism Testable
inferred← citeshttps://doi.org/10.1137/s0097539798343647openalex-snapshot
The Formula Isomorphism Problem
inferred← citeshttps://doi.org/10.1515/math-2015-0010openalex-snapshot
Invariance groups of finite functions and orbit equivalence of permutation groups
inferred← citeshttps://doi.org/10.1515/math-2018-0065openalex-snapshot
On generalizedP-reducible Finsler manifolds
inferred← citeshttps://doi.org/10.2478/v10179-012-0006-3openalex-snapshot
Representation of direct product of permutation groups as symmetry groups of boolean functions
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2011.115openalex-snapshot
Isomorphism testing of read-once functions and polynomials
inferred← citeshttps://doi.org/10.48550/arxiv.1303.1290openalex-snapshot
Symmetry groups of Boolean Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1910.11806openalex-snapshot
Symmetry groups of boolean functions: simple groups
inferred← citeshttps://doi.org/10.48550/arxiv.1912.11189openalex-snapshot
Computing the Number of Equivalent Classes on $\mathcal{R}(s,n)/\mathcal{R}(k,n)$
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.