Search results for "implicant"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
101	Christopher Umans	The Minimum Equivalent DNF Problem and Shortest Implicants.	FOCS	1998	DBLP DOI BibTeX RDF	minimum equivalent DNF, shortest implicant, complexity of approximation, computational complexity, logic minimization, polynomial hierarchy
73	Kuo-Hsing Cheng, Shun-Wen Cheng	Prioritized Prime Implicant Patterns Puzzle for Novel Logic Synthesis and Optimization.	ASP-DAC/VLSI Design	2002	DBLP DOI BibTeX RDF	full-swing logic, Low power design, VLSI design, hybrid logic, prime implicant
67	Neil V. Murray, Erik Rosenthal	Reduced Implicate/Implicant Tries.	ISMIS	2008	DBLP DOI BibTeX RDF
67	Christopher Umans	On the Complexity and Inapproximability of Shortest Implicant Problems.	ICALP	1999	DBLP DOI BibTeX RDF
48	Vasco M. Manquinho, Paulo F. Flores, João P. Marques Silva, Arlindo L. Oliveira	Prime Implicant Computation Using Satisfiability Algorithms.	ICTAI	1997	DBLP DOI BibTeX RDF	Integer Programming Algorithms, Propositional Satisfiability Algorithms, Backtrack Search Strategies, Prime Implicants
44	Yi Cao, Joseph C. Culberson, Lorna Stewart	DP-Complete Problems Derived from Extremal NP-Complete Properties.	MFCS	2009	DBLP DOI BibTeX RDF	DP-complete, extremal problem, unfrozen, complexity, colorability, implicant
44	Jason Cong, Kirill Minkovich	Improved SAT-based Boolean matching using implicants for LUT-based FPGAs.	FPGA	2007	DBLP DOI BibTeX RDF	logic synthesis, SAT, implicant, boolean matching, FPGA lookup table
38	Mehmet M. Dalkilic, Arijit Sengupta	A logic-theoretic classifier called Circle.	ICARCV	2004	DBLP DOI BibTeX RDF
38	Kazuyoshi Hayase, Hiroshi Imai	OBDDs of a Monotone Function and of Its Prime Implicants.	ISAAC	1996	DBLP DOI BibTeX RDF
38	Pranav Ashar, Srinivas Devadas, A. Richard Newton	Optimum and heuristic algorithms for an approach to finite state machine decomposition.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1991	DBLP DOI BibTeX RDF
38	Johan de Kleer, Alan K. Mackworth, Raymond Reiter	Characterizing Diagnoses.	Expert Systems in Engineering	1990	DBLP DOI BibTeX RDF
38	Pranav Ashar, Srinivas Devadas, A. Richard Newton	A Unified Approach to the Decomposition and Re-Decomposition of Sequential Machines.	DAC	1990	DBLP DOI BibTeX RDF
29	Jayashree Katti, Virendra Sule, B. K. Lande	Implicant based solver for XOR Boolean linear systems.	SpringSim (HPC)	2017	DBLP BibTeX RDF
29	Daniel Kane 0001, Osamu Watanabe 0001	A Short Implicant of a CNF Formula with Many Satisfying Assignments.	Algorithmica	2016	DBLP DOI BibTeX RDF
29	Virendra Sule	Implicant based parallel all solution solver for Boolean satisfiability.	CoRR	2016	DBLP BibTeX RDF
29	Ashok Kumar Palaniswamy, Spyros Tragoudas	Improved Threshold Logic Synthesis Using Implicant-Implicit Algorithms.	ACM J. Emerg. Technol. Comput. Syst.	2014	DBLP DOI BibTeX RDF
29	Daniel M. Kane, Osamu Watanabe 0001	A Short Implicant of a CNF Formula with Many Satisfying Assignments.	ISAAC	2014	DBLP DOI BibTeX RDF
29	Tony Ribeiro, Katsumi Inoue	Learning Prime Implicant Conditions from Interpretation Transition.	ILP	2014	DBLP DOI BibTeX RDF
29	Daniel M. Kane, Osamu Watanabe 0001	A Short Implicant of CNFs with Relatively Many Satisfying Assignments.	Electron. Colloquium Comput. Complex.	2013	DBLP BibTeX RDF
29	Camilla Schwind	Belief Base Change on Implicant Sets: How to Give Up Elements of a Belief Based on Literal Level.	CIS	2011	DBLP DOI BibTeX RDF
29	Neil V. Murray, Erik Rosenthal	Linear response time for implicate and implicant queries.	Knowl. Inf. Syst.	2010	DBLP DOI BibTeX RDF
29	Sirzat Kahramanli, Suleyman Tosun	A Novel Essential Prime Implicant Identification Method for Exact Direct Cover Logic Minimization.	CDES	2006	DBLP BibTeX RDF
29	Daniel Le Berre	Autour de SAT : le calcul d'impliquants P-restreints, algorithmes et applications. (Beyond SAT: P-restricted implicant, algorithms and applications).		2000	RDF
29	Ron Rymon	An Se-Tree-Based Prime Implicant Generation Algorithm.	Ann. Math. Artif. Intell.	1994	DBLP DOI BibTeX RDF
29	Yasuhiro Igarashi	The Size of Arrays for a Prime Implicant Generating Algorithm.	Comput. J.	1980	DBLP DOI BibTeX RDF
29	M. Ikram, Donald A. Roy	A Simple Technique to Improve the Pi-Algorithm for Prime Implicant Determination.	IEEE Trans. Computers	1976	DBLP DOI BibTeX RDF
29	Bernie L. Hulme	Richard B. Worrell: A Prime Implicant Algorithm with Factoring.	IEEE Trans. Computers	1975	DBLP DOI BibTeX RDF	Boolean functions, factoring, symbolic manipulation, prime implicants
29	Eugenio Morreale	Recursive Operators for Prime Implicant and Irredundant Normal Form Determination.	IEEE Trans. Computers	1970	DBLP DOI BibTeX RDF
29	Robert M. Bowman, Eugene S. McVey	A Method for the Fast Approximate Solution of Large Prime Implicant Charts.	IEEE Trans. Computers	1970	DBLP DOI BibTeX RDF
29	Eugenio Morreale	Partitioned List Algorithms for Prime Implicant Determination from Canonical Forms.	IEEE Trans. Electron. Comput.	1967	DBLP DOI BibTeX RDF
29	James F. Gimpel	A Reduction Technique for Prime Implicant Tables.	IEEE Trans. Electron. Comput.	1965	DBLP DOI BibTeX RDF
29	James F. Gimpel	A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table.	IEEE Trans. Electron. Comput.	1965	DBLP DOI BibTeX RDF
29	James F. Gimpel	A reduction technique for prime implicant tables	SWCT	1964	DBLP DOI BibTeX RDF
29	Insley B. Pyne, Edward Joseph McCluskey Jr.	The Reduction of Redundancy in Solving Prime Implicant Tables.	IRE Trans. Electron. Comput.	1962	DBLP DOI BibTeX RDF
29	Roger W. Hockney	An Intersection Algorithm Giving All Irredundant Normal Forms from a Prime Implicant List.	IRE Trans. Electron. Comput.	1962	DBLP DOI BibTeX RDF
25	Eduardo Romero-Aguirre, Juan Carlos Murrieta-Lee	A Survey of the Graphic Alternate Method for Boolean Functions Simplification.	CONIELECOMP	2005	DBLP DOI BibTeX RDF	Subminiterms, logic adjacency, variable-entered, miniterms rings, prime implicant
25	Hafiz Md. Hasan Babu, Moinul Islam Zaber, Md. Rafiqul Islam 0001, Md. Mazder Rahman	On the Minimization of Multiple-Valued Input Binary-Valued Output Functions.	ISMVL	2004	DBLP DOI BibTeX RDF	Multiple-Valued Input Two-Valued Output Functions, Sum-of-Products (SOPs), Logic Minimization, Prime Implicant
25	Yoshinori Yamamoto, Masao Mukaidono	P-Functions-Ternary Logic Functions Capable of Correcting Input Failures and Suitable for Treating Ambiguities.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	P-functions, ternary logic functions, input failures, regular ternary logic, all-prime-implicant disjoint, Boolean connective, irredundant disjunctive form, Boolean functions, ambiguities, ternary logic
25	Parthasarathy P. Tirumalai, Jon T. Butler	Minimization Algorithms for Multiple-Valued Programmable Logic Arrays.	IEEE Trans. Computers	1991	DBLP DOI BibTeX RDF	minimisation algorithms, multiple-valued programmable logic arrays, sum-of products, MIN operation, random-symmetric functions, constrained implicant sets, charge-coupled device circuits, performance, CMOS, heuristic algorithms, many-valued logics, minimisation, CMOS integrated circuits, backtracking, logic arrays, tree search, multiple-valued functions, charge-coupled device
25	Yue-Sun Kuo	Generating Essential Primes for a Boolean Function with Multiple-Valued Inputs.	IEEE Trans. Computers	1987	DBLP DOI BibTeX RDF	Boolean function with multiple-valued inputs, essential prime implicant, tautology checking, consensus, logic minimization, unate function
25	Hsiao-Peng Sherman Lee	An Algorithm for Minimal TANT Network Generation.	IEEE Trans. Computers	1978	DBLP DOI BibTeX RDF	TANT network, Minimal gate design, prime permissible implicant, second level minimization, third level minimization, tail factor
25	Sureshchander	Minimization of Switching Functions - A Fast Technique.	IEEE Trans. Computers	1975	DBLP DOI BibTeX RDF	DON'T CARE term, minimal sum, minterm, product-i, product-0, Consensus, prime implicant, subcube, literal
19	Sos S. Agaian, Ethan E. Danahy, Karen A. Panetta	Logical System Representation of Images and Removal of Impulse Noise.	IEEE Trans. Syst. Man Cybern. Part A	2008	DBLP DOI BibTeX RDF
19	Matthias P. Krieger	On the Incompressibility of Monotone DNFs.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
19	Judy Goldsmith, Matthias Hagen, Martin Mundhenk	Complexity of DNF and Isomorphism of Monotone Formulas.	MFCS	2005	DBLP DOI BibTeX RDF
19	Matthias P. Krieger	On the Incompressibility of Monotone DNFs.	FCT	2005	DBLP DOI BibTeX RDF
19	Jovanka Ciric, Carl Sechen	Efficient canonical form for Boolean matching of complex functions in large libraries.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2003	DBLP DOI BibTeX RDF
19	Tsutomu Sasao, Jon T. Butler	Worst and Best Irredundant Sum-of-Products Expressions.	IEEE Trans. Computers	2001	DBLP DOI BibTeX RDF	complete sum-of-products expressions, irredundant sum-of-products, heuristic minimization, minimum sum-of-products expressions, worst sum-of-products expressions, graph enumeration, minimally strongly connected digraphs, Logic minimization, prime implicants, symmetric functions, multiple-output functions
19	Petr Fiser, Jan Hlavicka	On the Use of Mutations in Boolean Minimization.	DSD	2001	DBLP DOI BibTeX RDF
19	Michael Theobald, Steven M. Nowick	An Implicit Method for Hazard-Free Two-Level Logic Minimization.	ASYNC	1998	DBLP DOI BibTeX RDF	hazard-free, two-level, dynamic-hazard-free prime implicants, asynchronous, BDD, logic minimization, implicit
19	Bernhard Beckert, Reiner Hähnle, Anavai Ramesh, Neil V. Murray	On Anti-Links.	LPAR	1994	DBLP DOI BibTeX RDF
19	Liliana Díaz-Olavarrieta, K. Illanko, Safwat G. Zaky	Goal-oriented decomposition of switching functions.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1993	DBLP DOI BibTeX RDF
19	Srinivas Devadas, A. Richard Newton	Exact algorithms for output encoding, state assignment, and four-level Boolean minimization.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1991	DBLP DOI BibTeX RDF
19	Gianfranco Bilardi, Abha Moitra	Time Lower Bounds For CREW-PRAM Computation Of Monotone Functions.	ICALP	1989	DBLP DOI BibTeX RDF