On the public citation graph

The Number of Transitivity Sets of Boolean Functions

0 signed · 28 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.
Claim with ORCID
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.
See reference health

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.1007/bf02546665openalex-snapshot
Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
inferredcites →https://doi.org/10.1016/s1385-7258(59)50008-6openalex-snapshot
Generalization of polya’s fundamental theorem in enumerative combinatorial analysis
inferredcites →https://doi.org/10.1090/s0002-9947-1942-0005739-6openalex-snapshot
Theory of Monomial Groups
inferredcites →https://doi.org/10.1147/rd.31.0046openalex-snapshot
The Multipurpose Bias Device—Part II: The Efficiency of Logical Elements
inferredcites →https://doi.org/10.2307/2001978openalex-snapshot
Logical Design of Electrical Circuits.
inferredcites →https://doi.org/10.2307/2266862openalex-snapshot
Sur les types des propositions composées
inferredcites →https://doi.org/10.4153/cjm-1953-020-xopenalex-snapshot
On The Number of Symmetry Types of Boolean Functions of n Variables

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11523468_27openalex-snapshot
Classification of Boolean Functions of 6 Variables or Less with Respect to Some Cryptographic Properties
inferred← citeshttps://doi.org/10.1007/978-3-319-40578-0_19openalex-snapshot
Enumeration of Reversible Functions and Its Application to Circuit Complexity
inferred← citeshttps://doi.org/10.1007/bf01069937openalex-snapshot
Self-dual transformations in multivalued logics
inferred← citeshttps://doi.org/10.1007/bfb0032037openalex-snapshot
Computing boolean functions on anonymous networks
inferred← citeshttps://doi.org/10.1007/s00285-019-01348-1openalex-snapshot
Low-dimensional representation of genomic sequences
inferred← citeshttps://doi.org/10.1007/s10601-020-09313-2openalex-snapshot
On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers
inferred← citeshttps://doi.org/10.1016/0016-0032(63)90456-3openalex-snapshot
On the number of classes of (n,k) switching networks
inferred← citeshttps://doi.org/10.1016/b978-0-12-509850-2.50009-9openalex-snapshot
COUNTING THEOREMS AND THEIR APPLICATIONS TO CLASSIFICATION OF SWITCHING FUNCTIONS
inferred← citeshttps://doi.org/10.1016/s0021-9800(68)80008-0openalex-snapshot
On the cycle index of a product of permutation groups
inferred← citeshttps://doi.org/10.1023/a:1022487918212openalex-snapshot
Balancing the n-Cube: A Census of Colorings
inferred← citeshttps://doi.org/10.1103/physreve.89.042808openalex-snapshot
Symmetry in critical random Boolean network dynamics
inferred← citeshttps://doi.org/10.1109/pgec.1963.263656openalex-snapshot
The Number of Equivalence Classes of Boolean Functions Under Groups Containing Negation
inferred← citeshttps://doi.org/10.1109/tc.1968.5008869openalex-snapshot
On Equivalence of State Assignments
inferred← citeshttps://doi.org/10.1109/tit.2020.3025767openalex-snapshot
On the Number of Equivalence Classes of Boolean and Invertible Boolean Functions
inferred← citeshttps://doi.org/10.1137/0112026openalex-snapshot
On the Classification of Boolean Functions by the General Linear and Affine Groups
inferred← citeshttps://doi.org/10.1145/321312.321325openalex-snapshot
On Asymptotic Estimates in Switching and Automata Theory
inferred← citeshttps://doi.org/10.2178/bsl/1246453975openalex-snapshot
Enumerating Types of Boolean Functions
inferred← citeshttps://doi.org/10.2298/pim1614095copenalex-snapshot
On the number of equivalence classes of invertible Boolean functions under action of permutation of variables on domain and range
inferred← citeshttps://doi.org/10.3233/fi-2010-339openalex-snapshot
Automorphissm Classification of Cellular Automata
inferred← citeshttps://doi.org/10.6100/ir570422openalex-snapshot
Investigations in the design and analysis of key-stream generators
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.