On the public citation graph
Canonical restricted mixed-polarity exclusive-OR sums of products and the efficient algorithm for their minimisation
0 signed · 45 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/978-1-4613-2821-6openalex-snapshot
Logic Minimization Algorithms for VLSI Synthesis
inferredcites →https://doi.org/10.1016/0010-4485(73)90119-xopenalex-snapshot
Easily testable realizations for logic functions
inferredcites →https://doi.org/10.1016/0378-4754(79)90148-4openalex-snapshot
Discrete and switching functions.
inferredcites →https://doi.org/10.1049/ip-e.1989.0058openalex-snapshot
Detection of stuck-at and bridging faults in reed—muller canonical (RMC) networks
inferredcites →https://doi.org/10.1049/ip-e:19830045openalex-snapshot
Efficient computer method for ExOR logic design
inferredcites →https://doi.org/10.1080/00207219108921277openalex-snapshot
Families of Reed-Muller canonical forms
inferredcites →https://doi.org/10.1109/12.45212openalex-snapshot
On the complexity of mod-2l sum PLA's
inferredcites →https://doi.org/10.1109/focs.1961.31openalex-snapshot
Switching function canonical forms based on commutative and associative binary operations
inferredcites →https://doi.org/10.1109/iccd.1991.139990openalex-snapshot
An algorithm for the multi-level minimization of Reed-Muller representations
inferredcites →https://doi.org/10.1109/iscas.1990.112455openalex-snapshot
An exact algorithm to minimize mixed-radix exclusive sums of products for incompletely specified Boolean functions
inferredcites →https://doi.org/10.1109/ismvl.1989.37793openalex-snapshot
Minimization of multiple-valued input multi-output mixed-radix exclusive sums of products for incompletely specified Boolean functions
inferredcites →https://doi.org/10.1109/ismvl.1991.130742openalex-snapshot
A transformation of multiple-valued input two-valued output functions and its application to simplification of exclusive-or sum-of-products expressions
inferredcites →https://doi.org/10.1109/ismvl.1992.186830openalex-snapshot
Optimization of multiple-valued AND-EXOR expressions using multiple-place decision diagrams
inferredcites →https://doi.org/10.1109/ismvl.1993.289569openalex-snapshot
EXORCISM-MV-2: minimization of exclusive sum of products expressions for multiple-valued input incompletely specified functions
inferredcites →https://doi.org/10.1109/t-c.1970.222878openalex-snapshot
Minimization of Exclusive or and Logical Equivalence Switching Circuits
inferredcites →https://doi.org/10.1109/t-c.1974.223935openalex-snapshot
A Note on Easily Testable Realizations for Logic Functions
inferredcites →https://doi.org/10.1109/t-c.1975.224108openalex-snapshot
Fault Detecting Test Sets for Reed-Muller Canonic Networks
inferredcites →https://doi.org/10.1109/tc.1978.1675057openalex-snapshot
Universal Test Sets for Multiple Fault Detection in AND-EXOR Arrays
inferredcites →https://doi.org/10.1109/tc.1979.1675308openalex-snapshot
Minimization of Modulo-2 Sum of Products
inferredcites →https://doi.org/10.1109/tec.1962.5219363openalex-snapshot
Inconsistent Canonical Forms of Switching Functions
inferredcites →https://doi.org/10.5555/285730.285799openalex-snapshot
A fast algorithm to minimize multi-output mixed-polarity generalized Reed-Muller forms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4613-1385-4_2openalex-snapshot
Representations of Logic Functions Using EXOR Operators
inferred← citeshttps://doi.org/10.1049/ip-cds:20000588openalex-snapshot
Generalised k-variable-mixed-polarity Reed–Muller expansions for system of Boolean functions and their minimisation
inferred← citeshttps://doi.org/10.1049/ip-cds:20010650openalex-snapshot
Efficient algorithm to calculate Reed–Muller expansions over GF(4)
inferred← citeshttps://doi.org/10.1049/ip-cdt:20020674openalex-snapshot
Exact minimisation of large multiple output FPRM functions
inferred← citeshttps://doi.org/10.1080/00207219508926279openalex-snapshot
An exact minimizer of fixed polarity Reed-Muller expansions
inferred← citeshttps://doi.org/10.1103/6vm9-21gropenalex-snapshot
Minimization of AND-XOR expressions with decoders for quantum circuits
inferred← citeshttps://doi.org/10.1109/12.600830openalex-snapshot
Easily testable realizations for generalized Reed-Muller expressions
inferred← citeshttps://doi.org/10.1109/43.494702openalex-snapshot
Minimization of exclusive sum-of-products expressions for multiple-valued input, incompletely specified functions
inferred← citeshttps://doi.org/10.1109/apccas.1994.514594openalex-snapshot
An exact minimization algorithm for generalized Reed-Muller expressions
inferred← citeshttps://doi.org/10.1109/aspdac.1995.486242openalex-snapshot
Flexible optimization of fixed polarity Reed-Muller expansions for multiple output completely and incompletely specified Boolean functions
inferred← citeshttps://doi.org/10.1109/aspdac.1995.486243openalex-snapshot
GRMIN: a heuristic simplification algorithm for generalized Reed-Muller expressions
inferred← citeshttps://doi.org/10.1109/ats.1994.367237openalex-snapshot
Easily testable realizations for generalized Reed-Muller expressions
inferred← citeshttps://doi.org/10.1109/dac.1996.545580openalex-snapshot
Multilevel logic synthesis for arithmetic functions
inferred← citeshttps://doi.org/10.1109/iscas.1999.777883openalex-snapshot
Optimization of partially-mixed-polarity Reed-Muller expansions
inferred← citeshttps://doi.org/10.1109/ismvl.1993.289569openalex-snapshot
EXORCISM-MV-2: minimization of exclusive sum of products expressions for multiple-valued input incompletely specified functions
inferred← citeshttps://doi.org/10.1109/rusautocon.2018.8501822openalex-snapshot
Model Design of Quantum Logic Circuits Based on Reed-Muller Expressions
inferred← citeshttps://doi.org/10.1109/tcad.2020.2966676openalex-snapshot
Development of Programmable Logic Array for Multiple-Valued Logic Functions
inferred← citeshttps://doi.org/10.1145/224818.224918openalex-snapshot
Flexible optimization of fixed polarity Reed-Muller expansions for multiple output completely and incompletely specified Boolean functions
inferred← citeshttps://doi.org/10.1145/240518.240563openalex-snapshot
Multilevel logic synthesis for arithmetic functions
inferred← citeshttps://doi.org/10.15760/etd.129openalex-snapshot
Design of Regular Reversible Quantum Circuits
inferred← citeshttps://doi.org/10.17869/enu.289028openalex-snapshot
A study of arithmetic circuits and the effect of utilising Reed-Muller techniques
inferred← citeshttps://doi.org/10.48550/arxiv.1902.06229openalex-snapshot
A Reed Muller-based approach for optimization of general binary quantum multiplexers
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.