MINIMAL MODULO-2 EXPRESSIONS OF SWITCHING FUNCTIONS WITH FIVE VARIABLESPAPAKONSTANTINOU G.1981; INT. J. ELECTRON. THEOR. EXP.; GBR; DA. 1981; VOL. 50; NO 3; PP. 211-214; BIBL. 3 REF.Article

USING MULTIPLEXERS TO REALIZE SWITCHING FUNCTIONS HAVING PARTICULAR PROPERTIESLOTFI ZM; TOSSER AJ.1979; INTERNATION. J. ELECTRON.; GBR; DA. 1979; VOL. 47; NO 3; PP. 253-266; BIBL. 17 REF.Article

A SUMMABILITY TESTINGSARGE A.1982; ELECTRONICS LETTERS; ISSN 0013-5194; GBR; DA. 1982; VOL. 18; NO 22; PP. 938-940; BIBL. 5 REF.Article

SYNTHESIS OF CUTPOINT CELLULAR ARRAYS WITH EXCLUSIVE OR COLLECTOR ROW.PAPAKONSTANTINOU G.1977; ELECTRON. LETTERS; G.B.; DA. 1977; VOL. 13; NO 16; PP. 486-487; BIBL. 3 REF.Article

MINIMIZATION OF SWITCHING FUNCTIONS: AN INTEGRATED APPROACHDASGUPTA P.1980; INT. J. ELECTRON. THEOR. EXP.; ISSN 0020-7217; GBR; DA. 1980; VOL. 49; NO 5; PP. 375-386; BIBL. 9 REF.Article

AN ALGORITHM FOR TRANSFORMATION OF AN ARBITRARY SWITCHING FUNCTION TO A COMPLETELY SYMMETRIC FUNCTION.LEE DT; SE JUNE HONG.1976; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1976; VOL. 25; NO 11; PP. 1117-1123; BIBL. 8 REF.Article

A COMPLETENESS CRITERION FOR SPECTRA.HIKITA T; NOZAKI A.1977; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1977; VOL. 6; NO 2; PP. 285-297; BIBL. 11 REF.Article

A METHOD FOR MODULO-2 MINIMIZATIONROBINSON JP; CHIA LUNG YEH.1982; IEEE TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1982; VOL. 31; NO 8; PP. 800-801; BIBL. 6 REF.Article

ON THE ENUMERATION OF DISTINCT FUZZY SWITCHING FUNCTIONSCLARK CM; BEN DAVID M; KANDEL A et al.1981; FUZZY SETS SYST.; ISSN 0165-0114; NLD; DA. 1981; VOL. 5; NO 1; PP. 69-81; BIBL. 32 REF.Article

KARNAUGH MAP SYNTHESIS OF MULTIGATE THRESHOLD NETWORKSSRIVATSA SK; BISWAS NN.1978; INTERNATION. J. SYST. SCI.; GBR; DA. 1978; VOL. 9; NO 7; PP. 785-797; BIBL. 12 REF.Article

ON THE FUNDAMENTAL STRUCTURE OF GALOIS SWITCHING FUNCTIONSBENJAUTHRIT B; REED IS.1978; I.E.E.E. TRANS. COMPUTERS; USA; DA. 1978; VOL. 27; NO 8; PP. 757-762; BIBL. 4 REF.Article

UNTERSUCHUNGEN ZUR ANWENDUNG MIKROZELLULARER STRUKTUREN. = RECHERCHES SUR L'UTILISATION DES STRUCTURES MICROCELLULAIRESMONJAU D.1978; NACHR.-TECH. ELEKTRON.; DDR; DA. 1978; VOL. 28; NO 9; PP. 371-374; ABS. RUS/ENG/FRE; BIBL. 6 REF.Article

STATIC-HAZARD DETECTION IN SWITCHING CIRCUITS BY PRIME-IMPLICANT EXAMINATION IN FUZZY FUNCTIONS.THAYSE A.1977; ELECTRON. LETTERS; G.B.; DA. 1977; VOL. 13; NO 4; PP. 94-96; BIBL. 11 REF.Article

CODAGE ET MINIMISATION DES FONCTIONS FLOUES DANS UNE ALGEBRE FLOUE.BENLAHCEN D; HIRSCH G; LAMOTTE M et al.1977; R.A.I.R.O., AUTOMAT.; FR.; DA. 1977; VOL. 11; NO 1; PP. 17-31; BIBL. 3 REF.Article

A GRAPH THEORETIC APPROACH TO SWITCHING FUNCTION MINIMIZATIONBHAT KVS.1982; J. FRANKLIN. INST.; ISSN 0016-0032; USA; DA. 1982; VOL. 313; NO 5; PP. 299-312; BIBL. 30 REF.Article

ALGEBRAICZNA METODA SYNTEZY TROJWARTOSCROWYCH UKLADOW LOGICZNYCH = METHODE ALGEBRIQUE DE SYNTHESE DES RESEAUX DE COMMUTATION TERNAIRESJACZEWSKI J; ZENKIEWICZ M.1981; ARCHIWUM AUTOMATYKI I TELEMECHANIKI; ISSN 0004-072X; POL; DA. 1981; VOL. 26; NO 3; PP. 397-410; ABS. RUS/ENG; BIBL. 16 REF.Article

MULTIPLEKSERY W UKLADAW KONBINACYJNYCH = LES MULTIPLEXEURS DANS LES CIRCUITS COMBINATOIRESTRACZYK W.1979; ARCH. AUTOMAT. TELEMECH.; POL; DA. 1979; VOL. 24; NO 3; PP. 371-383; ABS. RUS/ENG; BIBL. 4 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

LANGAGE DES FONCTIONS DE COMMUTATION VECTORIELLE POUR LA DESCRIPTION DES CIRCUITS LOGIQUESSIJMON AA.1977; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; S.S.S.R.; DA. 1977; NO 2; PP. 116-124; BIBL. 1 P.Article

ENUMERATION OF FANOUT-FREE BOOLEAN FUNCTIONS.HAYES JP.1976; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1976; VOL. 23; NO 4; PP. 700-709; BIBL. 14 REF.Article

QUADRATIC AUTOMATAGOLDMAN J; HOMER S.1982; JOURNAL OF COMPUTER AND SYSTEM SCIENCES; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 2; PP. 180-196; BIBL. 8 REF.Article

EIN LEISTUNGSFAEHIGER ALGORITHMUS ZUR OPTIMIERUNG VON FUNKTIONSBUENDELN = UN ALGORITHME HEURISTIQUE A DEUX PASSAGES POUR MINIMISER LES FONCTIONS DE COMMUTATION A SORTIES MULTIPLESGRASS W; THELEN B.1981; DIGIT. PROCESSES; ISSN 0301-4185; CHE; DA. 1981; VOL. 7; NO 1; PP. 1-19; ABS. ENG/FRE; BIBL. 9 REF.Article

ON THE THEORY OF FUZZY SWITCHING MECHANISMS (FSM'S)KANDEL A.1979; ADVANCES IN FUZZY SET THEORY AND APPLICATIONS; NLD; AMSTERDAM: NORTH-HOLLAND; DA. 1979; PP. 247-262; BIBL. 17 REF.Book Chapter

SWITCHING FUNCTIONS WHOSE MONOTONE COMPLEXITY IS NEARLY QUADRATICWEGENER I.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 9; NO 1; PP. 83-97; BIBL. 7 REF.Article

FANOUT-FREE BOOLEAN FUNCTIONS AND L-EXPRESSIONSAGARWAL VK.1978; CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS. 12/1978-03-29/BALTIMORE; USA; BALTIMORE: JOHNS HOPKINS UNIVERSITY; DA. 1978; PP. 227-233; BIBL. 10 REF.Conference Paper