On the public citation graph
Computation of Reed-Muller expansions of incompletely specified boolean functions from reduced representations
0 signed · 46 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/0001-8708(77)90018-4openalex-snapshot
Finite orthogonal series in the design of digital devices
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.1016/b978-0-12-400060-5.50008-2openalex-snapshot
SPECTRAL PROCESSING OF SWITCHING FUNCTIONS USING SIGNAL–FLOW TRANSFORMATIONS
inferredcites →https://doi.org/10.1049/ip-e.1987.0016openalex-snapshot
Graphical method for the conversion of minterms to Reed-Muller coefficients and the minimisation of exclusive-OR switching functions
inferredcites →https://doi.org/10.1109/43.31549openalex-snapshot
Design automation tools for efficient implementation of logic functions by decomposition
inferredcites →https://doi.org/10.1109/focs.1965.23openalex-snapshot
Procedures for minimization of "Exclusive-or" and "Logical-equivalence" switching circuits
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.223854openalex-snapshot
Algorithm for Minimal Polarized Polynomial Form Determination
inferredcites →https://doi.org/10.1109/tc.1977.1674830openalex-snapshot
A Note on Minimal Reed-Muller Canonical Forms of Switching Functions
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.1007/978-1-4615-3154-8_10openalex-snapshot
Efficient Spectral Techniques for Logic Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-031-79852-8openalex-snapshot
Representation of Multiple-Valued Logic Functions
inferred← citeshttps://doi.org/10.1007/s11704-017-6279-2openalex-snapshot
EDOA: an efficient delay optimization approach for mixed-polarity Reed-Muller logic circuits under the unit delay model
inferred← citeshttps://doi.org/10.1016/s1383-7621(00)00060-6openalex-snapshot
Baldwinian learning utilizing genetic and heuristic algorithms for logic synthesis and minimization of incompletely specified data with Generalized Reed–Muller (AND–EXOR) forms
inferred← citeshttps://doi.org/10.1023/b:aurc.0000030908.29984.caopenalex-snapshot
Algorithms for Synthesis of Polynomials Implementing Weakly Specified Boolean Functions and Systems
inferred← citeshttps://doi.org/10.1049/ip-cdt:20010252openalex-snapshot
Reed--Muller tree-based minimisation of fixed polarity Reed–Muller expansions
inferred← citeshttps://doi.org/10.1080/0020721031000093129openalex-snapshot
A new approach to generate fixed-polarity Reed–Muller expansions for completely and incompletely specified functions
inferred← citeshttps://doi.org/10.1080/00207219308907124openalex-snapshot
Optimization of Reed-Muller logic functions
inferred← citeshttps://doi.org/10.1080/002072197135931openalex-snapshot
Generating Kronecker expansions from reduced boolean forms using tabular methods
inferred← citeshttps://doi.org/10.1080/002072198133851openalex-snapshot
Modulo correlativity and its application in a multiple valued logic system
inferred← citeshttps://doi.org/10.1093/ietfec/e88-a.12.3332openalex-snapshot
Exact Minimization of FPRMs for Incompletely Specified Functions by Using MTBDDs
inferred← citeshttps://doi.org/10.1109/12.403717openalex-snapshot
A multiple-valued Reed-Muller transform for incompletely specified functions
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.2000.835105openalex-snapshot
Exact minimization of fixed polarity Reed-Muller expressions for incompletely specified functions
inferred← citeshttps://doi.org/10.1109/dac.1992.227867openalex-snapshot
Fast exact and quasi-minimal minimization of highly testable fixed-polarity AND/XOR canonical networks
inferred← citeshttps://doi.org/10.1109/edac.1992.205890openalex-snapshot
Multilevel logic synthesis based on functional decision diagrams
inferred← citeshttps://doi.org/10.1109/euasic.1991.212878openalex-snapshot
An efficient program for logic synthesis of mod-2 sum expressions
inferred← citeshttps://doi.org/10.1109/icccas.2007.4348267openalex-snapshot
A Method to Synthesize Boolean Quantum Circuit Based on Reed-Muller Expansions
inferred← citeshttps://doi.org/10.1109/iscas.2001.922017openalex-snapshot
Exploiting don't cares to minimize *BMDs
inferred← citeshttps://doi.org/10.1109/ismvl.1992.186816openalex-snapshot
Binary input/ternary output switching circuits designed via the sign transformation
inferred← citeshttps://doi.org/10.1109/ismvl.1995.513507openalex-snapshot
Reed-Muller forms for incompletely specified functions via sparse polynomial interpolation
inferred← citeshttps://doi.org/10.1109/ismvl.1996.508330openalex-snapshot
New interpolation algorithms for multiple-valued Reed-Muller forms
inferred← citeshttps://doi.org/10.1109/ismvl.1997.601375openalex-snapshot
Fast algorithm for minimizing Reed-Muller expansions of systems of incompletely specified MVL functions
inferred← citeshttps://doi.org/10.1109/itaic.2014.7065040openalex-snapshot
An efficient optimization algorithm for multi-output MPRM circuits with very large number of input variables
inferred← citeshttps://doi.org/10.1109/norchp.2005.1596996openalex-snapshot
Automated synthesis of delay-reduced Reed-Muller universal logic module networks
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/368434.368622openalex-snapshot
Exact minimization of fixed polarity Reed-Muller expressions for incompletely specified functions
inferred← citeshttps://doi.org/10.1155/1999/45607openalex-snapshot
An Efficient Algorithm for the Calculationof Generalized Adding and Arithmetic TransformsFrom Disjoint Cubes of Boolean Functions
inferred← citeshttps://doi.org/10.15760/etd.129openalex-snapshot
Design of Regular Reversible Quantum Circuits
inferred← citeshttps://doi.org/10.15760/etd.1338openalex-snapshot
Orthogonal and Nonorthogonal Expansions for Multi-Level Logic Synthesis for Nearly Linear Functions and their Application to Field Programmable Gate Array Mapping
inferred← citeshttps://doi.org/10.15760/etd.7850openalex-snapshot
Classical Search and Quantum Search Algorithms for Synthesis of Quantum Circuits and Optimization of Quantum Oracles
inferred← citeshttps://doi.org/10.2200/s00420ed1v01y201205dcs037openalex-snapshot
Representation of Multiple-Valued Logic Functions
inferred← citeshttps://doi.org/10.32657/10356/4188openalex-snapshot
Transforms and algorithms for spectral techniques in binary and multiple-valued logic
inferred← citeshttps://doi.org/10.5555/113938.113930openalex-snapshot
Fast exact and quasi-minimal minimization of highly testable fixed-polarity AND/XOR canonical networks
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.