On the public citation graph

On the Classification of Boolean Functions by the General Linear and Affine Groups

0 signed · 70 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.1960.tb03958.xopenalex-snapshot
Some Further Theory of Group Codes
inferredcites →https://doi.org/10.1007/bf02546665openalex-snapshot
Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
inferredcites →https://doi.org/10.1063/1.3060528openalex-snapshot
Linear Groups with an Exposition of the Galois Field Theory
inferredcites →https://doi.org/10.1109/pgec.1964.263724openalex-snapshot
Invertible Boolean Functions
inferredcites →https://doi.org/10.1109/tec.1961.5219245openalex-snapshot
A Modulo Two Adder for Three Inputs Using a Single Tunnel Diode
inferredcites →https://doi.org/10.1137/0111037openalex-snapshot
On the Theory of Boolean Formulas: Construction of the Set of the Formulas of Minimal Cost
inferredcites →https://doi.org/10.1137/0111059openalex-snapshot
The Number of Transitivity Sets of Boolean Functions
inferredcites →https://doi.org/10.1145/321150.321152openalex-snapshot
The Number of Classes of Invertible Boolean Functions
inferredcites →https://doi.org/10.1145/609784.609825openalex-snapshot
The application of counting techniques
inferredcites →https://doi.org/10.2307/1968675openalex-snapshot
Tables of Irreducible Polynomials for the First Four Prime Moduli
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/3-540-39200-9_3openalex-snapshot
A Toolbox for Cryptanalysis: Linear and Affine Equivalence Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-20323-8_9openalex-snapshot
An Algorithm for Linear, Affine and Spectral Classification of Boolean Functions
inferred← citeshttps://doi.org/10.1007/978-3-031-08754-7_28openalex-snapshot
Approximate Function Classification
inferred← citeshttps://doi.org/10.1007/978-3-319-16277-5_7openalex-snapshot
Affine Equivalency and Nonlinearity Preserving Bijective Mappings over $$\mathbb {F}_2$$
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/978-981-16-1089-9_24openalex-snapshot
A New Approach to Classify the Boolean Functions Based on Heuristic Technique
inferred← citeshttps://doi.org/10.1007/978-981-16-2709-5_52openalex-snapshot
Two New Approaches to Classify The Boolean Functions
inferred← citeshttps://doi.org/10.1007/bf01069821openalex-snapshot
Linear self-dual group over GF(2) and its effect on the algebra of Boolean functions
inferred← citeshttps://doi.org/10.1007/bf01070550openalex-snapshot
Number of invertible transformations in multivalued logics
inferred← citeshttps://doi.org/10.1007/bf01072161openalex-snapshot
Equivalence classes of invertible Boolean functions
inferred← citeshttps://doi.org/10.1007/bf01074878openalex-snapshot
On realization of quadratic boolean functions by systems of linear equations
inferred← citeshttps://doi.org/10.1007/bf02575756openalex-snapshot
Une généralisation de la notion de fonction Booléenne symétrique
inferred← citeshttps://doi.org/10.1007/s00012-011-0120-9openalex-snapshot
Clones with finitely many relative $${\mathcal {R}}$$ -classes
inferred← citeshttps://doi.org/10.1007/s002240000109openalex-snapshot
On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions
inferred← citeshttps://doi.org/10.1007/s10623-019-00604-1openalex-snapshot
Transparency order for Boolean functions: analysis and construction
inferred← citeshttps://doi.org/10.1007/s10773-020-04508-yopenalex-snapshot
Computing the Number of the Equivalence Classes for Reversible Logic Functions
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/b978-0-12-509850-2.50010-5openalex-snapshot
HARMONIC ANALYSIS OF SWITCHING FUNCTIONS
inferred← citeshttps://doi.org/10.1016/j.dam.2020.10.002openalex-snapshot
The number of affine equivalent classes and extended affine equivalent classes of vectorial Boolean functions
inferred← citeshttps://doi.org/10.1016/j.disc.2008.01.003openalex-snapshot
Equivalence of operations with respect to discriminator clones
inferred← citeshttps://doi.org/10.1016/j.disc.2015.05.017openalex-snapshot
Circulant matrices and affine equivalence of monomial rotation symmetric Boolean functions
inferred← citeshttps://doi.org/10.1016/j.ejc.2010.05.007openalex-snapshot
Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms
inferred← citeshttps://doi.org/10.1016/j.jisa.2017.01.001openalex-snapshot
Affine Boolean classification in secret image sharing for progressive quality access control
inferred← citeshttps://doi.org/10.1016/s0019-9958(80)90299-5openalex-snapshot
Affine and general linear equivalences of boolean functions
inferred← citeshttps://doi.org/10.1016/s0024-3795(96)00530-7openalex-snapshot
Cycle indices of linear, affine, and projective groups
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)66232-3openalex-snapshot
Affine classification of many-valued switching functions
inferred← citeshttps://doi.org/10.1023/a:1005769927571openalex-snapshot
Universal Affine Classification of Boolean Functions
inferred← citeshttps://doi.org/10.1109/access.2020.3039273openalex-snapshot
Classification of 4-bit S-Boxes for BOGI Permutation
inferred← citeshttps://doi.org/10.1109/aspdac.2018.8297398openalex-snapshot
A best-fit mapping algorithm to facilitate ESOP-decomposition in Clifford+T quantum network synthesis
inferred← citeshttps://doi.org/10.1109/ismvl60454.2024.00023openalex-snapshot
Ternary Function Classification Using Machine Learning
inferred← citeshttps://doi.org/10.1109/pgec.1967.264769openalex-snapshot
A Correspondence Between Equivalence Classes of Switching Functions and Group Codes
inferred← citeshttps://doi.org/10.1109/sct.1989.41803openalex-snapshot
Boolean functions, invariance groups and parallel complexity
inferred← citeshttps://doi.org/10.1109/swat.1968.3openalex-snapshot
A transform approach to logic design
inferred← citeshttps://doi.org/10.1109/t-c.1970.222995openalex-snapshot
A Transform Approach to Logic Design
inferred← citeshttps://doi.org/10.1109/tc.2016.2557329openalex-snapshot
Computing Affine Equivalence Classes of Boolean Functions by Group Isomorphism
inferred← citeshttps://doi.org/10.1109/tcad.2018.2859251openalex-snapshot
LUT-Based Hierarchical Reversible Logic Synthesis
inferred← citeshttps://doi.org/10.1109/tcad.2023.3235802openalex-snapshot
Generalized Affine Equivalence Checking of Boolean Functions via Reachability Analysis
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.1109/tit.2021.3087157openalex-snapshot
On the Number of Affine Equivalence Classes of Boolean Functions and q-Ary Functions
inferred← citeshttps://doi.org/10.1137/0220036openalex-snapshot
Boolean Functions, Invariance Groups, and Parallel Complexity
inferred← citeshttps://doi.org/10.1145/301250.301427openalex-snapshot
Hypergraph isomorphism and structural equivalence of Boolean functions
inferred← citeshttps://doi.org/10.1145/321312.321325openalex-snapshot
On Asymptotic Estimates in Switching and Automata Theory
inferred← citeshttps://doi.org/10.1155/2013/270424openalex-snapshot
Classification of Boolean Functions Where Affine Functions Are Uniformly Distributed
inferred← citeshttps://doi.org/10.1515/dma-2019-0035openalex-snapshot
On affine classification of permutations on the space GF(2)3
inferred← citeshttps://doi.org/10.1515/jmc-2016-0042openalex-snapshot
Affine equivalence of monomial rotation symmetric Boolean functions: A Pólya’s theorem approach
inferred← citeshttps://doi.org/10.15760/etd.2299openalex-snapshot
Reversible Circuits Synthesis Based on EXOR-sum of Products of EXOR-sums
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.33039/ami.2020.10.004openalex-snapshot
Thickness distribution of Boolean functions in 4 and 5 variables and a comparison with other cryptographic properties
inferred← citeshttps://doi.org/10.4213/dm1312openalex-snapshot
Классификация корреляционно-иммунных и минимальных корреляционно-иммунных булевых функций от 4 и 5 переменных
inferred← citeshttps://doi.org/10.4213/dm1495openalex-snapshot
Об аффинной классификации подстановок на пространстве $GF(2)^3$
inferred← citeshttps://doi.org/10.4213/mvk220openalex-snapshot
Bash-f: another LRX sponge function
inferred← citeshttps://doi.org/10.48550/arxiv.1705.04507openalex-snapshot
Classifying bent functions by their Cayley graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2005.01778openalex-snapshot
Determining the Multiplicative Complexity of Boolean Functions using SAT
inferred← citeshttps://doi.org/10.48550/arxiv.2007.12308openalex-snapshot
On the Number of Affine Equivalence Classes of Boolean Functions
inferred← citeshttps://doi.org/10.48550/arxiv.math/0703867openalex-snapshot
Subfunction relations defined by the clones containing all unary operations
inferred← citeshttps://doi.org/10.7151/dmgaa.1160openalex-snapshot
The submaximal clones on the three-element set with finitely many relative R-classes
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.