Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("FONCTION BOOLEENNE")

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

Results 1 to 25 of 1757

  • Page / 71
Export

Selection :

  • and

MIEKTORE WLASNOSCE ZBIOROW PODFUNKCJI FUNKCJI BOOLOWSKICH. = PROPRIETES DES SOUS-FONCTIONS DES FONCTIONS BOOLEENNESKERNTOPF P.1974; WARSZAWA; PAUSTW. WYDAWN. NAUK.; DA. 1974; PP. 1-77; ABS. ANGL. RUSSE; BIBL. 4 P. 1/2Book

ETUDE D'UNE ALGEBRE BOOLEENNE TEMPORELLESIFAKIS J.1972; C.R. ACAD. SCI., A; FR.; DA. 1972; VOL. 275; NO 25; PP. 1343-1346; BIBL. 1 REF.Serial Issue

ON GENERALIZED BOOLEAN FUNCTIONS ITANDAREANU N.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 34; NO 3; PP. 293-299; BIBL. 2 REF.Article

SPERNER TYPE THEOREMS AND COMPLEXITY OF MINIMAL DISJUNCTIVE NORMAL FORMS OF MONOTONE BOOLEAN FUNCTIONSGRONAU HDOF.1981; PERIOD. MATH. HUNG.; ISSN 0031-5303; HUN; DA. 1981; VOL. 12; NO 4; PP. 267-282; BIBL. 16 REF.Article

FERMETURES I-GENERATRICES - APPLICATION AUX FONCTIONS BOOLEENNES PERMUTANTES.DESCHAMPS J.1975; DISCRETE MATH.; NETHERL.; DA. 1975; VOL. 13; NO 4; PP. 321-339; BIBL. 4 REF.Article

GENERATING TEST EXAMPLES FOR HEURISTIC BOOLEAN MINIMIZATION.OSTAPKO DL; HONG SJ.1974; I.B.M. J. RES. DEVELOP.; U.S.A.; DA. 1974; VOL. 18; NO 5; PP. 459-464; BIBL. 7 REF.Article

AMELIORATION DE L'ALGORITHME DE MCCLUSKEY-HARRISON POUR CALCULER LES MONOMES D'UNE FONCTION BOOLEENNE.PICHAT E.1974; AUTOMATISME; FR.; DA. 1974; VOL. 19; NO 5; PP. 297-301; ABS. ANGL.; BIBL. 3 REF.Article

ESSAIS SUR LA FORMULATION ET LE TRAITEMENT ALGEBRIQUE DES RAISONNEMENTS. II. LES NOTIONS D'EXISTENCE, D'OCCURENCE, DE CONCEVABILITE.THOMAS R.1974; AUTOMATISME; FR.; DA. 1974; VOL. 19; NO 11; PP. 541-546; ABS. ANGL.; BIBL. 6 REF.Article

AN ANALYSIS OF SOME RELATIONSHIPS BETWEEN POST AND BOOLEAN ALGEBRAS.WOJCIK AS; METZE G.1974; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1974; VOL. 21; NO 4; PP. 680-696; BIBL. 18 REF.Article

A COMPILER FOR SIMPLE BOOLEAN FUNCTIONS OF BINARY PATTERNS.ULLMANN JR.1973; COMPUTER GRAPH. IMAGE PROCESSG; U.S.A.; DA. 1973; VOL. 2; NO 2; PP. 93-102; BIBL. 15 REF.Article

THRESHOLD NUMBERS AND THRESHOLD COMPLETIONSHAMMER PL; IBARAKI T; PELED U et al.1980; ANN. DISCRETE MATH.; NLD; DA. 1980; VOL. 9; PP. 103-106; BIBL. 5 REF.Article

ON THE NUMBER OF PRIME IMPLICANTSCHANDRA AK; MARKOWSKY G.1978; DISCRETE MATH.; NLD; DA. 1978; VOL. 24; NO 1; PP. 7-11; BIBL. 7 REF.Article

EIN VERFAHREN ZUR LOESUNG BOOLESCHER GLEICHUNGEN. = UNE METHODE POUR LA RESOLUTION D'EQUATIONS DE BOOLEPOSTHOFF C; MITEW W.1975; NACHR.-TECH., ELEKTRON.; DTSCH.; DA. 1975; VOL. 25; NO 6; PP. 222-224; BIBL. 1 REF.Article

SUR UNE METHODE DE RECONNAISSANCE, BASEE SUR LA DIVISION DES CLASSES PAR LES FORMES NORMALES DISJONCTIVESASLANYAN LA.1975; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1975; NO 5; PP. 103-110; ABS. ANGL.; BIBL. 6 REF.Article

MINIMISATION DES FONCTIONS BOOLEENNES ET ALGORITHMES EFFECTIFS DE RECONNAISSANCEGUREVICH IB; ZHURAVLEV YU I.1974; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1974; NO 3; PP. 16-20; ABS. ANGL.; BIBL. 2 REF.Article

SUR LES METHODES DE REALISATION SEQUENTIELLE DES FONCTIONS BOOLEENNES SYMETRIQUESSAVCHENKO YU G; KHMELEVAYA AV.1974; AVTOMAT. VYCHISLIT. TEKH., LATV. S.S.R.; S.S.S.R.; DA. 1974; PP. 24-29; BIBL. 3 REF.Article

UNE METHODE DE SYNTHESE DE GENERATEURS DE VARIABLES ALEATOIRES BOOLEENNESRUSZCZYNSKI A.1974; ARCH. AUTOMAT. TELEMECH.; POLSKA; DA. 1974; VOL. 19; NO 1; PP. 125-131; ABS. RUSSE ANGL.; BIBL. 5 REF.Article

SOME REMARKS ON THE TENSORIAL LINEARIZATION OF GENERAL AND LINEARLY SEPARABLE BOOLEAN FUNCTIONSCAIANIELLO ER.1973; KYBERNETIK; DTSCH.; DA. 1973; VOL. 12; NO 2; PP. 90-93; BIBL. 1 REF.Serial Issue

AN ITERATIVE ALGORITHM FOR SOLVING THE REALIZATION PROBLEM OF A BOOLEAN FUNCTION BY A SINGLE THRESHOLD ELEMENTSAJDA J.1972; ACTA FAC. RERUM NAT. UNIV. COMENIANAE, MATH.; TCHECOSL.; DA. 1972; VOL. 26; PP. 1-18; BIBL. 5 REF.Serial Issue

REDUCIBILITY AS A TOOL TO EXTEND THE POWER OF APPROXIMATION ALGORITHMS. THE MINIMIZATION OF BOOLEAN EXPRESSIONS.AIELLO A; BURATTINI E; MASSAROTTI A et al.1977; R.A.I.R.O., INFORMAT. THEOR.; FR.; DA. 1977; VOL. 11; NO 1; PP. 75-82; ABS. FR.; BIBL. 7 REF.Article

COMPLEXITE DES CALCULS APPROCHES DES FONCTIONS BOLEENNES ET DE LEURS PROLONGEMENTSNAZARYAN GA.1975; AKAD. NAUK ARM. S.S.R., DOKL.; S.S.S.R.; DA. 1975; VOL. 61; NO 2; PP. 70-75; ABS. ARM.; BIBL. 15 REF.Article

FAN-IN CONSTRAINED TREE NETWORKS OF FLEXIBLE CELLS.CHAKRABARTI K; KOLP O.1974; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1974; VOL. 23; NO 12; PP. 1238-1249; BIBL. 13 REF.Article

ON COMPLEMENTATION OF BOOLEAN FUNCTIONSHONG SJ; OSTAPKO DL.1972; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1972; VOL. 21; NO 9; PP. 1022Serial Issue

LA SYNTHESE LOGIQUE DES PROTECTIONS DE CENTRALES ET DE POSTESPOLYAKOV VE; TROTSENKO AA.1972; IZVEST. VYSSCH. UCHEBN. ZAVED., ENERGET.; S.S.S.R.; DA. 1972; VOL. 15; NO 7; PP. 13-17; BIBL. 3 REF.Serial Issue

SUR LA REALISATION DES FONCTIONS BOOLEENNES SUR DES ELEMENTS ARBITRAIRESBIVOL LG.1972; IN: ABSTR. STRUKT. TEOR. RELEJNYKH USTROJSTV; MOSKVA; NAUKA; DA. 1972; PP. 32-38; BIBL. 1 REF.Book

  • Page / 71