Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("FORME NORMALE")

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 1867

  • Page / 75
Export

Selection :

  • and

POLYNOMIAL ALGORITHMS FOR COMPUTING THE SMITH AND HERMITE NORMAL FORMS OF AN INTEGER MATRIXRAVINDRAM KANNAN; ACHIM BACHEM.1979; S.I.A.M. J. COMPUTG; USA; DA. 1979; VOL. 8; NO 4; PP. 499-507; BIBL. 17 REF.Article

APPROXIMATION DE QUELQUES CLASSES DU CALCUL CLASSIQUE DES PREDICATS PAR DES CLASSES RESOLUBLES. INORGELA S.1980; LITOV. MAT. SBOR.; SUN; DA. 1980; VOL. 20; NO 1; PP. 135-143; ABS. LIT/ENG; BIBL. 6 REF.Article

NORMAL FORMS FOR HAMILTONIAN SYSTEMS.MEYER KR.1974; CELEST. MECH.; NETHERL.; DA. 1974; VOL. 9; NO 4; PP. 517-522; BIBL. 4 REF.Article

THE STRUCTURE OF INTEGER PROGRAMS UNDER THE HERMITIAN NORMAL FORM.BOWMAN VJ.1974; OPER. RES.; U.S.A.; DA. 1974; VOL. 22; NO 5; PP. 1067-1080; BIBL. 10 REF.Article

MINIMISATION DES SYSTEMES DE FONCTIONS BOOLEENNES DANS LA CLASSE DES FORMES NORMALES DISJONCTIVESMARKOVSKIJ AV.1972; IN: ABSTR. STRUKT. TEOR. RELEJNYKH USTROJSTV; MOSKVA; NAUKA; DA. 1972; PP. 167-181; BIBL. 9 REF.Book

EINE REPRAESENTATIVE AUSWAHL VON KNOTENMATRIZEN ZU KLASSEN ISOMORPHER GRAPHEN = UNE SELECTION REPRESENTATIVE DES MATRICES DECRIVANT DES CLASSES DE GRAPHES ISOMORPHESREUSS WJ.1982; COMPUTING; ISSN 0010-485X; AUT; DA. 1982; VOL. 28; NO 3; PP. 247-255; ABS. ENG; BIBL. 4 REF.Article

EIN VORSCHLAG FUER DIE VERWENDUNG SYNTAX-ORIENTIERTER METHODEN IN HOEHEREN PROGRAMMIERSPRACHEN. = UNE PROPOSITION POUR L'USAGE DE METHODES ORIENTEES VERS LA SYNTAXE DANS LES LANGAGES DE PROGRAMMATIONMAURER H; STUCKY W.1976; ANGEW. INFORMAT.; DTSCH.; DA. 1976; NO 5; PP. 189-195; ABS. ANGL.; BIBL. 4 REF.Article

SUR LA REALISATION DES FORMES NORMALES DISJONCTIVES DE FONCTIONS BOOLEENNES SUR UNE AIRE MINIMALE DANS UN MILIEU DE CALCULACHASOVA SM.sdVYCHISLIT. SIT.; SIST.; (1971); NO 47; PP. 41-44; BIBL. 5 REF.Serial Issue

INVERTIBLE TERMS IN THE LAMBDA CALCULUSBERGSTRA J; KLOP JW.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 11; NO 1; PP. 19-37; BIBL. 13 REF.Article

MINIMISIERUNG SCHALTALGEBRAISCHER AUSDRUECKE DURCH AUSWAHL VON PRIMKONJUNKTIONEN OHNE RUECKGRIFF AUF DIE KANONISCHE ALTERNATIVE NORMALFORM = MINIMISATION D'EXPRESSIONS PROPOSITIONNELLES ALGEBRIQUES PAR LE CHOIX D'UNE CONJONCTION PRIMAIRE SANS RECOURS A LA FORME NORMALE CANONIQUE ALTERNATIVEBARTHEL D.1979; ELEKTRON. INFORM.-VERARBEIT KYBERN.; DDR; DA. 1979; VOL. 15; NO 4; PP. 213-220; ABS. ENG/RUS; BIBL. 4 REF.Article

A MODEL OF A DOCUMENT RETRIEVAL SYSTEM BASED ON THE CONCEPT OF A SEMANTIC DISJUNCTIVE NORMAL FORMRADECKI T.1981; KYBERNETES; ISSN 0368-492X; GBR; DA. 1981; VOL. 10; NO 1; PP. 35-42; BIBL. 8 REF.Article

ALGORITHMS FOR FINDING CHOMSKY AND GREIBACH NORMAL FORMS FOR A FUZZY CONTEXT-FREE GRAMMAR USING AN ALGEBRAIC APPROACHLEE ET.1983; KYBERNETES; ISSN 0368-492X; GBR; DA. 1983; VOL. 12; NO 2; PP. 125-134; BIBL. 16 REF.Article

COMPLETENESS OF CONTEXT-FREE GRAMMAR FORMSMAURER HA; SALOMAA A; WOOD D et al.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 23; NO 1; PP. 1-10; BIBL. 14 REF.Article

DEMONSTRATION ELEMENTAIRE ET APPLICATIONS D'UN THEOREME DE F. TAKENSSADOVSKIJ AP.1980; DIFFER. URAVN. (MINSK, 1965); ISSN 0374-0641; BYS; DA. 1980; VOL. 16; NO 12; PP. 2284-2287; BIBL. 11 REF.Article

COMPLEXITY OF PARTIAL SATISFACTIONLIEBERHERR K; SPECKER E.1979; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 20/1979/SAN JUAN P.R.; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1979; PP. 132-139; BIBL. 12 REF.Conference Paper

FROM LEFT-REGULAR TO GREIBACH NORMAL FORM GRAMMARSNIJHOLT A.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 9; NO 1; PP. 51-55; BIBL. 14 REF.Article

ON RATIONAL DEFINITIONS IN COMPLETE ALGEBRAS WITHOUT RANKINDERMARK K.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 21; NO 3; PP. 281-313; BIBL. 17 REF.Article

REMARKS ON THE ALGEBRA OF NON FIRST NORMAL FORM RELATIONSJAESCHKE G; SCHEK HJ.1982; SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS/1982-03-29/LOS ANGELES CA; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1982; PP. 124-138; BIBL. 18 REF.Conference Paper

COMPARAISON DES FONCTIONS BOOLEENNES SUIVANT LES FORMES NORMALES IMPARFAITESPOVAROV GN.1982; IZV. AKAD. NAUK SSSR, TEH. KIBERN.; ISSN 0002-3388; SUN; DA. 1982; NO 1; PP. 209-210; BIBL. 4 REF.Article

MINIMIZATION OF DISJUNCTIVE NORMAL FORMS OF FUZZY LOGIC FUNCTIONSBHAT KVS.1981; J. FRANKLIN INST.; ISSN 0016-0032; USA; DA. 1981; VOL. 311; NO 3; PP. 171-185; BIBL. 16 REF.Article

CIRCUITS SEQUENTIELS AUTONOMES ANTITONIQUES. II. CYCLOGRAMMES ET LEURS PROPRIETESSTARODUBTSEV NA.1981; IZV. AKAD. NAUK SSSR, TEH. KIBERN.; ISSN 0002-3388; SUN; DA. 1981; NO 5; PP. 87-93; BIBL. 4 REF.Article

A NORMAL FORM THEOREM FOR LABEL GRAMMARSJANTZEN M; OPP M.1981; MATH. SYST. THEORY; ISSN 0025-5661; DEU; DA. 1981; VOL. 14; NO 4; PP. 289-303; BIBL. 12 REF.Article

REDUCTION D'UN SYSTEME D'EQUATIONS DIFFERENTIELLES A LA FORME NORMALE PAR UNE TRANSFORMATION ANALYTIQUEZINCHENKO IL.1978; VEST. LENINGRAD. UNIV.; SUN; DA. 1978; NO 13; PP. 136-138; ABS. ENG; BIBL. 2 REF.Article

SUR LA COMPLEXITE DES FORMES NORMALES DISJONCTIVES OBTENUES A L'AIDE DE L'ALGORITHME DU GRADIENTSAPOZHENKO AA.1972; DISKRETN. ANAL.; S.S.S.R.; DA. 1972; NO 21; PP. 62-71; BIBL. 8 REF.Serial Issue

A MULTIVARIABLE NORMAL-FORM FOR MODEL REDUCTION OF DISCRETE-TIME SYSTEMSBADREDDIN E; MANSOUR M.1983; SYSTEMS AND CONTROL LETTERS; ISSN 509167; NLD; DA. 1983; VOL. 2; NO 5; PP. 271-285; BIBL. 11 REF.Article

  • Page / 75