The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for implicant with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1962-1989 (15) 1990-2000 (15) 2001-2009 (15) 2010-2017 (9)
Publication types (Num. hits)
article(28) inproceedings(25) phdthesis(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 52 occurrences of 39 keywords

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