The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1960-1972 (16) 1973-1979 (15) 1980-1991 (16) 1992-1996 (17) 1997-1999 (18) 2000-2004 (18) 2005-2008 (17) 2009-2014 (16) 2015-2022 (16) 2023 (4)
Publication types (Num. hits)
article(75) inproceedings(77) phdthesis(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 121 occurrences of 89 keywords

Results
Found 153 publication records. Showing 153 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
141Pablo Cordero, Manuel Enciso, Inman P. de Guzmán Bases for closed sets of implicants and implicates in temporal logic. Search on Bibsonomy Acta Informatica The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
106Pablo Cordero, Gloria Gutiérrez, Javier Martínez 0001, Inmaculada Perez de Guzmán A New Algebraic Tool for Automatic Theorem Provers. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF multisemilattice, theorem provers, automated deduction, implicants, ideals, lattice theory
73Sasan Iman, Massoud Pedram Two-level logic minimization for low power. Search on Bibsonomy ICCAD The full citation details ... 1995 DBLP  DOI  BibTeX  RDF Power Prime Implicants, low power two-level logic minimization, minimum covering problem, minimum power solution, static CMOS circuits, logic design, logic CAD, integrated circuit design, CMOS logic circuits, circuit CAD, circuit optimisation, minimisation of switching nets
67Prathima Agrawal, Vishwani D. Agrawal, Nripendra N. Biswas Multiple output minimization. Search on Bibsonomy DAC The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
62Zekie Shevked, Ludmil Dakovski Learning and classification with prime implicants applied to medical data diagnosis. Search on Bibsonomy CompSysTech The full citation details ... 2007 DBLP  DOI  BibTeX  RDF classification, diagnosis, minimization, concept learning, prime implicants, medical data
57Anavai Ramesh, Neil V. Murray Non-Clausal Deductive Techniques for Computing Prime Implicants and Prime Implicates. Search on Bibsonomy LPAR The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
56Vasco 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
50Petr Fiser, Jan Hlavicka, Hana Kubátová FC-Min: A Fast Multi-Output Boolean Minimizer. Search on Bibsonomy DSD The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
45Raymond P. Voith ULM Implicants for Minimization of Universal Logic Module Circuits. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1977 DBLP  DOI  BibTeX  RDF universal functions, optimization, logic design, integrated circuits, logic circuits, multiplexers, Boolean algebra, prime implicants
45Bernd Reusch Generation of Prime Implicants from Subfunctions and a Unifying Approach to the Covering Problem. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1975 DBLP  DOI  BibTeX  RDF Boolean minimization, subfunctions, trees, prime implicants, covering problem
45Donald L. Dietmeyer Generating prime implicants via ternary encoding and decimal arithmetic. Search on Bibsonomy Commun. ACM The full citation details ... 1968 DBLP  DOI  BibTeX  RDF extremal, ternary encoding, minimization, switching function, prime implicants, cubical complexes
40Jason 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
39Georg Gottlob, Francesco Scarcello, Martha Sideri Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning. Search on Bibsonomy LPNMR The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Complexity, Logic Programming, Constraint Satisfaction, Nonmonotonic Reasoning, Fixed-parameter Tractability, Stable Models, Prime Implicants, Circumscription
39Michael 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
34Neil V. Murray, Erik Rosenthal Reduced Implicate/Implicant Tries. Search on Bibsonomy ISMIS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
34Dariusz Kania A new approach to logic synthesis of multi-output boolean functions on pal-based CPLDS. Search on Bibsonomy ACM Great Lakes Symposium on VLSI The full citation details ... 2007 DBLP  DOI  BibTeX  RDF logic synthesis, technology mapping, CPLDs
34Judy 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
34Petr Fiser, Hana Kubátová Boolean Minimizer FC-Min: Coverage Finding Process. Search on Bibsonomy DSD The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
34Yutaka Hata, Kiyoshi Hayase, Takahiro Hozumi, Naotake Kamiura, Kazuharu Yamato Multiple-Valued Logic Minimization by Genetic Algorithms. Search on Bibsonomy ISMVL The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
34Yutaka Hata, Naotake Kamiura, Kazuharu Yamato On Input Permutation Technique for Multiple-Valued Logic Synthesis. Search on Bibsonomy ISMVL The full citation details ... 1995 DBLP  DOI  BibTeX  RDF input permutation technique, multiple-valued logic synthesis, multiple valued sum of products expressions, TSUM, minimal sum of products expressions, permuted logic values, randomly generated functions, input permutation, output permutation, minimization times, window literals, sum of products expressions, set literals, logic design, set theory, multivalued logic
34Patrick C. McGeer, Jagesh V. Sanghavi, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli ESPRESSO-SIGNATURE: a new exact minimizer for logic functions. Search on Bibsonomy IEEE Trans. Very Large Scale Integr. Syst. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
34Sorin Istrail, Dejan Zivkovic A Non-Probabilistic Switching Lemma for the Sipser Function. Search on Bibsonomy STACS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
23Alexis de Colnet, Pierre Marquis On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
23Virendra Sule Deciding One to One property of Boolean maps: Condition and algorithm in terms of implicants. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
23Hénoïk Willot, Sébastien Destercke, Khaled Belahcène Les implicants premiers, un outil polyvalent pour l'explication de classification robuste. Search on Bibsonomy JIAF The full citation details ... 2023 DBLP  BibTeX  RDF
23Hénoïk Willot, Sébastien Destercke, Khaled Belahcène Prime implicants as a versatile tool to explain robust classification. Search on Bibsonomy ISIPTA The full citation details ... 2023 DBLP  BibTeX  RDF
23Christophe Labreuche Explanation of Pseudo-Boolean Functions Using Cooperative Game Theory and Prime Implicants. Search on Bibsonomy SUM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
23Hénoïk Willot, Sébastien Destercke, Khaled Belahcène Explaining Robust Classification Through Prime Implicants. Search on Bibsonomy SUM The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
23Hénoïk Willot, Sébastien Destercke, Khaled Belahcène Explications de classifications robustes à l'aide d'implicants premiers. Search on Bibsonomy LFA The full citation details ... 2022 DBLP  BibTeX  RDF
23Alexis de Colnet, Pierre Marquis On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits. Search on Bibsonomy ISAIM The full citation details ... 2022 DBLP  BibTeX  RDF
23Alexis de Colnet, Pierre Marquis On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits. Search on Bibsonomy IJCAI The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
23Stephan Wäldchen Towards explainable artificial intelligence: interpreting neural network classifiers with probabilistic prime implicants. Search on Bibsonomy 2022   RDF
23Rajeswari Devadoss, Kolin Paul, M. Balakrishnan Equivalence Checking and Compaction of n-input Majority Terms Using Implicants of Majority. Search on Bibsonomy J. Electron. Test. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
23Rajeswari Devadoss, Kolin Paul, M. Balakrishnan Majority Logic: Prime Implicants and n-Input Majority Term Equivalence. Search on Bibsonomy VLSID The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
23Yakoub Salhi Approaches for Enumerating All the Essential Prime Implicants. Search on Bibsonomy AIMSA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
23Yakoub Salhi A Method for Generating all the Prime Implicants of Binary CNF Formulas. Search on Bibsonomy ISAIM The full citation details ... 2018 DBLP  BibTeX  RDF
23Federico Buffoni, Gabriele Gianini, Ernesto Damiani, Michael Granitzer All-Implicants Neural Networks for Efficient Boolean Function Representation. Search on Bibsonomy ICCC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
23Tero Tyrväinen Prime implicants in dynamic reliability analysis. Search on Bibsonomy Reliab. Eng. Syst. Saf. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
23Navid Talebanfard On the structure and the number of prime implicants of 2-s. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
23Sunil R. Das, Abdullah-Al Amin, Satyendra N. Biswas, Mansour H. Assaf, Emil M. Petriu, Voicu Groza An algorithm for generating prime implicants. Search on Bibsonomy I2MTC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
23Francesco Di Maio, Samuele Baronchelli, Enrico Zio A Visual Interactive Method for Prime Implicants Identification. Search on Bibsonomy IEEE Trans. Reliab. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
23Thomas Ferrère, Oded Maler, Dejan Nickovic Trace Diagnostics Using Temporal Implicants. Search on Bibsonomy ATVA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
23Meghyn Bienvenu Prime Implicates and Prime Implicants: From Propositional to Modal Logic. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
23Navid Talebanfard On the Structure and the Number of Prime Implicants of k-CNF Formulas. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
23Manoj K. Raut, Arindama Singh A survey on computing prime implicants and implicates in classical and non-classical logics. Search on Bibsonomy Comput. Syst. Sci. Eng. The full citation details ... 2014 DBLP  BibTeX  RDF
23Saïd Jabbour, João Marques-Silva 0001, Lakhdar Sais, Yakoub Salhi Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form. Search on Bibsonomy JELIA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
23Marija Slavkovik 0001, Thomas Ågotnes A judgment set similarity measure based on prime implicants. Search on Bibsonomy AAMAS The full citation details ... 2014 DBLP  BibTeX  RDF
23Ondrej Cepek, Petr Kucera, Stanislav Kurik Boolean functions with long prime implicants. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
23David Déharbe, Pascal Fontaine, Daniel Le Berre, Bertrand Mazure Computing prime implicants. Search on Bibsonomy FMCAD The full citation details ... 2013 DBLP  BibTeX  RDF
23Ondrej Cepek, Petr Kucera, Stanislav Kurik Boolean functions with long prime implicants. Search on Bibsonomy ISAIM The full citation details ... 2012 DBLP  BibTeX  RDF
23Fatih Basçiftçi, Sirzat Kahramanli Fast computation of the prime implicants by exact direct-cover algorithm based on the new partial ordering operation rule. Search on Bibsonomy Adv. Eng. Softw. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
23Fatih Basçiftçi, Sirzat Kahramanli A Reduced Offset Based Method for Fast Computation of the Prime Implicants Covering a Given Cube Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
23Emanuele Borgonovo The reliability importance of components and prime implicants in coherent and non-coherent systems including total-order interactions. Search on Bibsonomy Eur. J. Oper. Res. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
23Jianlin Qiu, Xiang Gu 0001, Dan Ji, Fen Li, Peng He, Bo Wang Logic functions minimization algorithm based on recognition of essential prime implicants. Search on Bibsonomy ICNC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
23Meghyn Bienvenu Prime Implicates and Prime Implicants: From Propositional to Modal Logic. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
23Laurent Perrussel, Jerusa Marchi, Guilherme Bittencourt Prime Implicants and Belief Update. Search on Bibsonomy FLAIRS The full citation details ... 2009 DBLP  BibTeX  RDF
23Robert H. Sloan, Balázs Szörényi, György Turán On k-Term DNF with the Largest Number of Prime Implicants. Search on Bibsonomy SIAM J. Discret. Math. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
23David J. Rosenbaum 0001, Marek A. Perkowski Superposed Quantum State Initialization Using Disjoint Prime Implicants (SQUID). Search on Bibsonomy ISMVL The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Superposed, Quantum Computing, Superposition
23Meghyn Bienvenu Prime Implicates and Prime Implicants in Modal Logic. Search on Bibsonomy AAAI The full citation details ... 2007 DBLP  BibTeX  RDF
23Neil Kettle, Andy King, Tadeusz Strzemecki Widening ROBDDs with Prime Implicants. Search on Bibsonomy TACAS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF ROBDD, widening, approximation, abstract interpretation
23Robert H. Sloan, Balázs Szörényi, György Turán On k-term DNF with largest number of prime implicants Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2005 DBLP  BibTeX  RDF
23Manoj K. Raut, Arindama Singh Prime implicants of first order formulas via transversal clauses. Search on Bibsonomy Int. J. Comput. Math. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
23Pablo Cordero, Manuel Enciso, Inmaculada Perez de Guzmán From the Poset of Temporal Implicates/implicants to a Temporal Negative Form. Search on Bibsonomy Reports Math. Log. The full citation details ... 2002 DBLP  BibTeX  RDF
23Christopher Umans The Minimum Equivalent DNF Problem and Shortest Implicants. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
23Inman P. de Guzmán, Manuel Enciso, Pablo Cordero A temporal negative normal form which preserves implicants and implicates. Search on Bibsonomy J. Appl. Non Class. Logics The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
23Arindama Singh Computing prime implicants via transversal clauses. Search on Bibsonomy Int. J. Comput. Math. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
23Luigi Palopoli 0001, Fiora Pirri, Clara Pizzuti Algorithms for Selective Enumeration of Prime Implicants. Search on Bibsonomy Artif. Intell. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
23Yacine Boufkhad, Olivier Dubois 0002 Length of Prime Implicants and Number of Solutions of Random CNF Formulae. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
23A. K. Shiny, Arun K. Pujari An Efficient Algorithm to Generate Prime Implicants. Search on Bibsonomy J. Autom. Reason. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
23Inman P. de Guzmán, Pablo Cordero, Manuel Enciso Structure Theorems for Closed Sets of Implicates/ Implicants in Temporal Logic. Search on Bibsonomy EPIA The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
23Kazuyoshi Hayase, Hiroshi Imai OBDDs of a Monotone Function and Its Prime Implicants. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
23A. K. Shiny, Arun K. Pujari Computation of Prime Implicants Using Matrix and Paths. Search on Bibsonomy J. Log. Comput. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
23Christopher 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
23Anavai Ramesh, George Becker, Neil V. Murray CNF and DNF Considered Harmful for Computing Prime Implicants/Implicates. Search on Bibsonomy J. Autom. Reason. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
23Dominik Stoffel, Wolfgang Kunz, Stefan Gerber 0002 AND/OR reasoning graphs for determining prime implicants in multi-level combinational networks. Search on Bibsonomy ASP-DAC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
23Kazuyoshi 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
23Clara Pizzuti Computing Prime Implicants by Integer Programming. Search on Bibsonomy ICTAI The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
23Thierry Castell Computation of Prime Implicates and Prime Implicants by a Variant of the Davis and Putnam Procedure. Search on Bibsonomy ICTAI The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
23Uwe Hartmann From Prime Implicants to Modular Feedforward Networks. Search on Bibsonomy ICANNGA The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
23Olivier Coudert, Jean Christophe Madre Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes. Search on Bibsonomy RAIRO Theor. Informatics Appl. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
23Ron Rymon On Kernel Rule's and Prime Implicants. Search on Bibsonomy AAAI The full citation details ... 1994 DBLP  BibTeX  RDF
23Anavai Ramesh, Neil V. Murray Computing Prime Implicants/Implicates for Regular Logics. Search on Bibsonomy ISMVL The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
23Fiora Pirri, Clara Pizzuti Characterizing Prime Implicants as Projective Spaces. Search on Bibsonomy AI*IA The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
23Tadeusz Strzemecki Polynomial-time algorithms for generation of prime implicants. Search on Bibsonomy J. Complex. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
23Anavai Ramesh, George Becker, Neil V. Murray On Computing Prime Implicants and Prime Implicates. Search on Bibsonomy TABLEAUX The full citation details ... 1992 DBLP  BibTeX  RDF
23Yutaka Hata, Fujio Miyawaki, Kazuharu Yamato Optimal Output Assignment and the Maximum Number of Implicants Needed to Cover the Multiple-Valued Logic Functions. Search on Bibsonomy ISMVL The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
23Gerhard W. Dueck, G. H. John van Rees On the Maximum Number of Implicants Needed to Cover a Multiple-Valued Logic Function Using Window Literals. Search on Bibsonomy ISMVL The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
23Alex Kean, George K. Tsiknis An Incremental Method for Generating Prime Implicants/Impicates. Search on Bibsonomy J. Symb. Comput. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
23Peter Jackson, John Pais Computing Prime Implicants. Search on Bibsonomy CADE The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
23Sharon R. Perkins, Tom Rhyne An algorithm for identifying and selecting the primed implicants of a multiple-output Boolean function. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
23Ingo Wegener Prime implicants and parallel complexity. Search on Bibsonomy Bull. EATCS The full citation details ... 1988 DBLP  BibTeX  RDF
23Curtis T. McMullen, J. Shearer Prime Implicants, Minimum Covers, and the Complexity of Logic Simplification. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
23Karl Weber Prime Implicants of Random Boolean Functions. Search on Bibsonomy J. Inf. Process. Cybern. The full citation details ... 1983 DBLP  BibTeX  RDF
23Walter Oberschelp Fast parallel algorithms for finding all prime implicants for discrete functions. Search on Bibsonomy Logic and Machines The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
23Robert Brian Cutler, Saburo Muroga Useless prime implicants of incompletely specified multiple-output switching functions. Search on Bibsonomy Int. J. Parallel Program. The full citation details ... 1980 DBLP  DOI  BibTeX  RDF
23Ashok K. Chandra, George Markowsky On the number of prime implicants. Search on Bibsonomy Discret. Math. The full citation details ... 1978 DBLP  DOI  BibTeX  RDF
23Constantin Virgil Negoita, Dan A. Ralescu Comment on a Comment on an Algorithm that Generates Fuzzy Prime Implicants by Lee and Chang Search on Bibsonomy Inf. Control. The full citation details ... 1976 DBLP  DOI  BibTeX  RDF
23H. R. Hwa A Method for Generating Prime Implicants of a Boolean Expression. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1974 DBLP  DOI  BibTeX  RDF
23Philip S. Noe, V. Thomas Rhyne, S. Suraratrungsi Comments on "Weighting Method for the Determination of the Irredundant Set of Prime Implicants". Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1974 DBLP  DOI  BibTeX  RDF
23Abraham Kandel Corrigendum: "Comment on an Algorithm that Generates Fuzzy Prime Implicants by Lee and Chang" Search on Bibsonomy Inf. Control. The full citation details ... 1974 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 153 (100 per page; Change: )
Pages: [1][2][>>]
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