Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("COMPLEXITE CALCUL")

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

Results 1 to 25 of 14732

  • Page / 590

Export

Selection :

  • and

LOWER BOUNDS OF THE COMPLEXITY OF LINEAR ALGEBRASBINI D; CAPOVANI M.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 9; NO 1; PP. 46-47; BIBL. 3 REF.Article

PARTITION OPTIMALE D'UN ENSEMBLE FINI EN SOUS-ENSEMBLESTANAEV VS.1979; DOKL. AKAD. NAUK B.S.S.R.; BYS; DA. 1979; VOL. 23; NO 1; PP. 26-28; ABS. ENG; BIBL. 4 REF.Article

A NOTE ON LOCATING A SET OF POINTS IN A PLANAR SUBDIVISIONPREPARATA FP.1979; S.I.A.M.J. COMPUTG; USA; DA. 1979; VOL. 8; NO 4; PP. 542-545; BIBL. 4 REF.Article

AN ANALYSIS OF GENERALIZATION AS A SEARCH PROBLEMMITCHELL TM.1979; IJCAI 79. INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE. 6/1979/TOKYO; USA; S.L.: INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE; DA. 1979; VOL. 1; PP. 577-582; BIBL. 13 REF.Conference Paper

ALGEBRAS HAVING LINEAR MULTIPLICATIVE COMPLEXITIES.FIDUCCIA CM; ZALCSTEIN Y.1977; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1977; VOL. 24; NO 2; PP. 311-331; BIBL. 28 REF.Article

ON THE COMPLEXITY OF CAUSAL MODELS.GAINES BR.1976; I.E.E.E. TRANS. SYST. MAN CYBERN.; U.S.A.; DA. 1976; VOL. 6; NO 1; PP. 56-59; BIBL. 11 REF.Article

ON THE NUMBER OF ADDITIONS TO COMPUTE SPECIFIC POLYNOMIALS.BORODIN A; COOK S.1976; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1976; VOL. 5; NO 1; PP. 146-157; BIBL. 11 REF.Article

COMPUTATIONAL COMPLEXITY OF INNER PRODUCTS OF VECTORS (AND THAT OF OTHER BILINEAR FORMS) OVER A NONCOMMUTATIVE RING (AUXILIARY FUNCTIONS ALLOWED).MANDL R; VARI T.1975; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 1; PP. 49-55; BIBL. 9 REF.Article

ON COMPUTING THE LENGTH OF LONGEST INCREASING SUBSEQUENCES.FREDMAN ML.1975; DISCRETE MATH.; NETHERL.; DA. 1975; VOL. 11; NO 1; PP. 29-35; BIBL. 2 REF.Article

THE TIME REQUIRED TO EVALUATE DIVISION-FREE ARITHMETIC EXPRESSIONS.PREPARATA FP; MULLER DE.1975; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1975; VOL. 3; NO 5; PP. 144-146; BIBL. 4 REF.Article

APPROCHE PAR APPROXIMATION FINIE DE L'ETUDE DE LA COMPLEXITE DES PREDICATS RECURSIFSFREJDZON RI.1975; ZAP. NAUCH. SEMINAR. L.O.M.I.; S.S.S.R.; DA. 1975; VOL. 49; PP. 131-158; ABS. ANGL.; BIBL. 1 P. 1/2Article

BOUNDS FOR 3-MATROID INTERSECTION PROBLEMS.CAMERINI PM; MAFFIOLI F.1975; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1975; VOL. 3; NO 3; PP. 81-83; BIBL. 10 REF.Article

A UNIFIED VIEW OF THE COMPLEXITY OF EVALUATION AND INTERPOLATION.HOROWITZ E.1974; ACTA INFORMAT.; ALLEM.; DA. 1974; VOL. 3; NO 2; PP. 123-133; BIBL. 12 REF.Article

ON THE SIZE OF SETS OF COMPUTABLE FUNCTIONS.MEHLHORN K.1973; IN: ANNU. SYMP. SWITCHING AUTOM. THEORY. 14; IOWA CITY; 1973; NORTHRIDGE; INST. ELECTR. ELECTRON. ENG. INC.; DA. 1973; PP. 190-196; BIBL. 9 REF.Conference Paper

A NOTION OF HELPING AND PSEUDO-COMPLEMENTATION IN LATTICES OF HONEST SUBRECURSIVE CLASSES.MACHTEY M.1973; IN: ANNU. SYMP. SWITCHING AUTOM. THEORY. 14; IOWA CITY; 1973; NORTHRIDGE; INST. ELECTR. ELECTRON. ENG. INC.; DA. 1973; PP. 181-189; BIBL. 7 REF.Conference Paper

MAXIMIZING A LOWER BOUND IN THE COMPUTATIONAL COMPLEXITYGATI G.1982; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1982; VOL. 4; NO 3; PP. 175-180; BIBL. 4 REF.Article

THE RELATIONSHIP BETWEEN THE COMPUTATIONAL COMPLEXITIES OF THE LEGITIMATE DECK AND ISOMORPHISM PROBLEMSMANSFIELD A.1982; Q. J. MATH.; ISSN 0033-5606; GBR; DA. 1982; VOL. 33; NO 131; PP. 345-347; BIBL. 4 REF.Article

MAINTENANCE OF CONFIGURATIONS IN THE PLANEOVERMARS MH; VAN LEEUWEN J.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 23; NO 2; PP. 166-204; BIBL. 31 REF.Conference Paper

MODERATELY EXPONENTIAL BOUND FOR GRAPH ISOMORPHISMBAHAI L.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 34-50; BIBL. 32 REF.Conference Paper

DE LA POSSIBILITAT A L'EFICIENCIA: UN INTENT D'EXPLICAR EN FORMA ENTENEDORA ALGUNS ASPECTES TEORICS DE LA CALCULACIO = DE LA POSSIBILITE A L'EFFICACITE: UNE TENTATIVE D'EXPLICATION DE QUELQUES ASPECTS THEORIQUES DE LA CALCULABILITECASAS R; DIAZ J.1981; NOVATICA; ISSN 0211-2124; ESP; DA. 1981; VOL. 7; NO 38-39; PP. 7-15; 7 P.; BIBL. 4 REF.Article

ON THE COMPLEXITY OF COMPUTING BILINEAR FORMS WITH (0,1) CONSTANTSGONZALEZ T; JA'JA' J.1980; J. COMPUTER SYST. SCI.; USA; DA. 1980; VOL. 20; NO 1; PP. 77-95; BIBL. 16 REF.Article

ON THE COMPLEXITY OF INEXACT COMPUTATIONS.PEARL J.1975; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1975; VOL. 4; NO 3; PP. 77-81; BIBL. 5 REF.Article

APPROXIMATE IDENTIFICATION OF AUTOMATA. = IDENTIFICATION APPROCHEE D'AUTOMATESGAINES BR.1975; ELECTRON. LETTERS; G.B.; DA. 1975; VOL. 11; NO 18; PP. 444-445; BIBL. 8 REF.Article

ON ALMOST EVERYWHERE COMPLEX RECURSIVE FUNCTIONS.GILL J; BLUM M.1974; J. ASS. COMPUTG. MACHIN.; U.S.A.; DA. 1974; VOL. 21; NO 3; PP. 425-435; BIBL. 14 REF.Article

INDUCTIVE INFERENCE: A RECURSION THEORETIC APPROACH.BLUM L; BLUM M.1973; IN: ANNU. SYMP. SWITCHING AUTOM. THEORY. 14; IOWA CITY; 1973; NORTHRIDGE; INST. ELECTR. ELECTRON. ENG. INC.; DA. 1973; PP. 200-208; BIBL. 9 REF.Conference Paper

  • Page / 590