On the public citation graph
On the size of PLAs required to realize binary and multiple-valued functions
0 signed · 26 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.1049/ep.1980.0099openalex-snapshot
Logic Design and Switching Theory
inferredcites →https://doi.org/10.1049/ip-e.1987.0032openalex-snapshot
Analysis of input and output configurations for use in four-valued CCD programmable logic arrays
inferredcites →https://doi.org/10.1080/00029890.1975.11993939openalex-snapshot
On the Applications of Möbius Inversion in Combinatorial Analysis
inferredcites →https://doi.org/10.1109/12.21150openalex-snapshot
On the optimal design of multiple-valued PLAs
inferredcites →https://doi.org/10.1109/pgec.1964.263776openalex-snapshot
Average Values of Quantities Appearing in Boolean Function Minimization
inferredcites →https://doi.org/10.1109/pgec.1965.263994openalex-snapshot
Average Values of Quantities Appearing in Multiple Output Boolean Minimization
inferredcites →https://doi.org/10.1109/tc.1981.1675861openalex-snapshot
Multiple-Valued Decomposition of Generalized Boolean Functions and the Complexity of Programmable Logic Arrays
inferredcites →https://doi.org/10.1109/tc.1984.1676349openalex-snapshot
Input Variable Assignment and Output Phase Optimization of PLA's
inferredcites →https://doi.org/10.1109/tc.1985.1676549openalex-snapshot
An Algorithm to Derive the Complement of a Binary Function with Multiple-Valued Inputs
inferredcites →https://doi.org/10.1109/tc.1987.1676883openalex-snapshot
Using Decision Trees to Derive the Complement of a Binary Function with Multiple-Valued Inputs
inferredcites →https://doi.org/10.1145/321281.321287openalex-snapshot
Statistical Complexity of Algorithms for Boolean Function Minimization
inferredcites →https://doi.org/10.2307/2319793openalex-snapshot
On the Applications of Mobius Inversion in Combinatorial Analysis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00211-gopenalex-snapshot
A new lower bound on the expected size of irredundant forms for Boolean functions
inferred← citeshttps://doi.org/10.1016/j.optcom.2010.02.031openalex-snapshot
Design of SOA-MZI based all-optical programmable logic device (PLD)
inferred← citeshttps://doi.org/10.1109/12.250617openalex-snapshot
An optimization technique for the design of multiple valued PLA's
inferred← citeshttps://doi.org/10.1109/12.73587openalex-snapshot
Minimization algorithms for multiple-valued programmable logic arrays
inferred← citeshttps://doi.org/10.1109/12.88488openalex-snapshot
Bounds on the average number of products in the minimum sum-of-products expressions for multiple-value input two-valued output functions
inferred← citeshttps://doi.org/10.1109/dsd.2005.13openalex-snapshot
An Advanced Minimization Technique for Multiple Valued Multiple Output Logic Expressions Using LUT and Realization Using Current Mode CMOS
inferred← citeshttps://doi.org/10.1109/ismvl.1988.5178openalex-snapshot
Analysis of minimization algorithms for multiple-valued programmable logic arrays
inferred← citeshttps://doi.org/10.1109/ismvl.1992.186821openalex-snapshot
Optimal output assignment and the maximum number of implicants needed to cover the multiple-valued logic functions
inferred← citeshttps://doi.org/10.1109/ismvl.1993.289556openalex-snapshot
Multiple-valued logic functions represented by TSUM, TPRODUCT, NOT and variables
inferred← citeshttps://doi.org/10.1109/ismvl.1994.302220openalex-snapshot
A multiple-valued logic synthesis using the Kleenean coefficients
inferred← citeshttps://doi.org/10.1109/ismvl.1995.513527openalex-snapshot
On input permutation technique for multiple-valued logic synthesis
inferred← citeshttps://doi.org/10.1109/ismvl.1996.508333openalex-snapshot
A necessary and sufficient condition for Lukasiewicz logic functions
inferred← citeshttps://doi.org/10.1109/ismvl.1997.601381openalex-snapshot
Multiple-valued product-of-sums expression with truncated sum
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.