Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("IMPLICANT")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1471

  • Page / 59
Export

Selection :

  • and

COLUMN TABLE APPROACH FOR THE MINIMIZATION OF FUZZY FUNCTIONS.RICKMAN SM; KANDEL A.1977; INFORM. SCI.; U.S.A.; DA. 1977; VOL. 12; NO 2; PP. 111-128; BIBL. 3 REF.Article

Material implication and entailmentCENIZA, C. R.Notre Dame journal of formal logic. 1988, Vol 29, Num 4, pp 510-519, issn 0029-4527Article

ANATOMY OF BOOLEAN-FUNCTION SIMPLIFICATIONBESSLICH PW.1979; I.E.E. J. COMPUT. DIGIT. TECH.; GBR; DA. 1979; VOL. 2; NO 1; PP. 7-12; ABS. GER; BIBL. 45 REF.Article

REPRESENTATION DES FONCTIONS BOOLEENNES PAR UNE SOMME MODULO 2 D'IMPLICATIONS DES ARGUMENTSAVSARKISYAN GS.1977; AVTOMAT. VYCHISLIT. TEKH., LATV. S.S.R.; S.S.S.R.; DA. 1977; NO 1; PP. 8-11; BIBL. 2 REF.Article

A striking off procedure for searching for the prime implicants of a logic functionPETROWSKI, A; LEGRAND, L; BECHARD, H et al.International journal of electronics. 1983, Vol 55, Num 6, pp 823-828, issn 0020-7217Article

A FAST PROCEDURE FOR FINDING PRIME IMPLICANTS OF A BOOLEAN FUNCTIONGUPTA SC.1981; INT. J. ELECTRON. THEOR. EXP.; ISSN 0020-7217; GBR; DA. 1981; VOL. 51; NO 5; PP. 701-709; BIBL. 6 REF.Article

A literal code method for minimizing boolean functionsMIYAKOSHI, H.Computer journal (Print). 1990, Vol 33, Num 4, pp 375-380, issn 0010-4620, 6 p.Article

Input variable assignment and output phase optimization of PLA'sSASAO, T.IEEE transactions on computers. 1984, Vol 33, Num 10, pp 879-894, issn 0018-9340Article

SYNDROME-TESTABLE DESIGN OF COMBINATIONAL CIRCUITSSAVIR J.1980; IEEE TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1980; VOL. 29; NO 6; PP. 442-451; BIBL. 10 REF.Article

GROUPING TABLE FOR THE MINIMISATION OF N-VARIABLE BOOLEAN FUNCTIONSHALDER AK.1978; PROC. INSTIT. ELECTR. ENGRS; GBR; DA. 1978; VOL. 125; NO 6; PP. 474-482; BIBL. 8 REF.Article

FUZZY MAPS.SCHWEDE GW; KANDEL A.1977; I.E.E.E. TRANS. SYST. MAN CYBERN.; U.S.A.; DA. 1977; VOL. 7; NO 9; PP. 669-674; BIBL. 7 REF.Article

A NOTE ON THE SIMPLIFICATION OF FUZZY SWITCHING FUNCTIONS.KANDEL A.1977; INFORM. SCI.; U.S.A.; DA. 1977; VOL. 13; NO 2; PP. 91-94; BIBL. 5 REF.Article

TABULAR MINIMIZATION OF FUZZY SWITCHING FUNCTIONS.RICKMAN SM; KANDEL A.1976; I.E.E.E. TRANS. SYST. MAN CYBERN.; U.S.A.; DA. 1976; VOL. 6; NO 11; PP. 766-769; BIBL. 11 REF.Article

INTRODUCTION DE L'IMPLICATION DANS LES FORMULES INDEMONTRABLES DE LA LOGIQUE DES PROPOSITIONS DE VALIDITE GENERALE INTUITIONNISTE FINIESKVORTSOV DP.1976; MAT. ZAMET.; S.S.S.R.; DA. 1976; VOL. 20; NO 3; PP. 383-390; BIBL. 5 REF.Article

Two-level multiple-output logic minimization using a single functionRUSHDI, Ali M; BA-RUKAB, Omar M.International journal of computer mathematics. 2003, Vol 80, Num 8, pp 979-985, issn 0020-7160, 7 p.Article

ALGORITHMS FOR COMPUTING THE MAXIMUM NUMBER OF PRIME IMPLICANTS OF SYMMETRIC BOOLEAN FUNCTIONSIGARASHI Y.1980; TRANS. INST. ELECTRON. COMMUN. ENG. JPN., SECT. E; ISSN 0387-236X; JPN; DA. 1980; VOL. 63; NO 10; PP. 693-699; BIBL. 11 REF.Article

BOOLEAN DIFFERENCE CALCULUSTHAYSE A.1980; DIGIT. PROCESSES; ISSN 0301-4185; CHE; DA. 1980; VOL. 6; NO 2-3; PP. 175-184; ABS. FRE/GER; BIBL. 9 REF.Article

MEET AND JOIN DERIVATIVES AND THEIR USE IN SWITCHING THEORY = DERIVES D'INTERSECTION ET DE REUNION ET LEUR UTILISATION EN THEORIE DE LA COMMUTATIONTHAYSE A.1978; I.E.E.E. TRANS. COMPUTERS; USA; DA. 1978; VOL. 27; NO 8; PP. 713-720; BIBL. 9 REF.Article

A corrigendum for the optimized-IPIAKEAN, A; TSIKNIS, G.Journal of symbolic computation. 1994, Vol 17, Num 2, pp 181-187, issn 0747-7171Article

ON THE WALSH-HADAMARD TRANSFORM AND PRIME IMPLICANT EXTRACTIONBESSLIGH PW.1978; I.E.E.E. TRANS. ELECTROMAGN. COMPATIB.; USA; DA. 1978; VOL. 20; NO 4; PP. 516-519; BIBL. 10 REF.Article

Aspects probabilistes et algorithmiques du problème de satisfiabilité = Algorithmic and probabilistic aspects of the satisfiability problemBoufkhad, Yacine; Pomerol, Jean Charles.1996, 132 p.Thesis

Novelty revisitedMarquis, Pierre.1991, 10 p.Report

USELESS PRIME IMPLICANTS OF INCOMPLETELY SPECIFIED MULTIPLE-OUTPUT SWITCHING FUNCTIONSCUTLER RB; MUROGA S.1980; INT. J. COMPUT. INF. SCI.; ISSN 0091-7036; USA; DA. 1980; VOL. 9; NO 4; PP. 337-350; BIBL. 4 REF.Article

AN IMPROVED LOWER BOUND ON THE MAXIMUM NUMBER OF PRIME IMPLICANTS = BORNE INFERIEURE AMELIOREE POUR LE NOMBRE MAXIMAL D'IMPLICANTS PREMIERSIGARASHI Y.1979; TRANS. INST. ELECTRON. COMMUNIC. ENGRS JAP.; JPN; DA. 1979; VOL. 62; NO 6; PP. 389-394; BIBL. 8 REF.Article

GENERATION OF PRIME IMPLICANTS OF A BOOLEAN FUNCTION FROM MINTERM SUBLISTS.SHIVA SG.1976; IN: ANNU. SOUTHEAST. SYMP. SYST. THEORY. 8. PROC.; KNOXVILLE, TENN.; 1976; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1976; PP. 244-245; BIBL. 4 REF.Conference Paper

  • Page / 59