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

BUSY BEAVER SETS AND THE DEGREES OF UNSOLVABILITYDALEY RP.1981; J. SYMB. LOGIC; ISSN 0022-4812; USA; DA. 1981; VOL. 46; NO 3; PP. 460-474; BIBL. 12 REF.Article

DYNAMIZATION OF DECOMPOSABLE SEARCHING PROBLEMSVAN LEEUWEN J; WOOD D.1980; INFORM. PROCESSG LETTERS; NLD; DA. 1980; VOL. 10; NO 2; PP. 51-56; BIBL. 6 REF.Article

NEGATION CAN BE EXPONENTIALLY POWERFULVALIANT LG.1980; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1980; VOL. 12; NO 3; PP. 303-314; BIBL. 23 REF.Article

THE COMPUTATIONAL COMPLEXITY OF MATROID PROPERTIESROBINSON GC; WELSH DJA.1980; MATH. PROC. CAMBRIDGE PHILOS. SOC.; GBR; DA. 1980; VOL. 87; NO 1; PP. 29-45; BIBL. 17 REF.Article

PACKINGS OF GRAPHS AND APPLICATIONS TO COMPUTATIONAL COMPLEXITYBOLLOBAS B; ELDRIDGE SE.1978; J. COMBINATOR. THEORY, B; USA; DA. 1978; VOL. 25; NO 2; PP. 105-124; BIBL. 9 REF.Article

COMMUTATIVITY, NON-COMMUTATIVITY, AND BILINEARITY.PROBERT RL.1976; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1976; VOL. 5; NO 2; PP. 46-49; BIBL. 5 REF.Article

ON THE EVALUATION OF POWERS.CHI CHIH YAO A.1976; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1976; VOL. 5; NO 1; PP. 100-103; BIBL. 4 REF.Article

BERECHNUNGEN UND DIE KOMPLIZIERTHEIT VON BEZIEHUNGEN. = CALCULS ET COMPLEXITE DES RELATIONSKARACUBA AA.1975; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1975; VOL. 11; NO 10-12; PP. 603-606; BIBL. 4 REF.; (INT. SYMP. DISKRETE MATH. ANWEND. MATH. KYBERN.; BERLIN; 1974). RESUMEConference Paper

THE COMPLEXITY OF THEORIES OF THE MONADIC PREDICATE CALCULUS.RACKOFF C.1975; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1975; NO 136; PP. 1-11; ABS. FR.; BIBL. 6 REF.Serial Issue

TIME BOUNDS ON THE PARALLEL EVALUATION OF ARITHMETIC EXPRESSIONS.KUCK DJ; MARUYAMA K.1975; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 2; PP. 147-162; BIBL. 19 REF.Article