A NOTE ON THE COMPLEXITY OF ALGEBRAIC DIFFERENTIATION.CAVINESS BF; EPSTEIN HI.1978; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1978; VOL. 7; NO 2; PP. 122-124; BIBL. 6 REF.Article

AN OPTIMAL LOWER BOUND ON THE NUMBER OF TOTAL OPERATIONS TO COMPUTE 0-1 POLYNOMIALS OVER THE FIELD OF COMPLEX NUMBERSVAN DE WIELE JP.1978; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FRA; DA. 1978; NO 303; PP. 1-19; ABS. FRE; BIBL. 13 REF.Serial Issue

COMPLEXICITY RESULTS FOR BANDWIDTH MINIMIZATION.GAREY MR; GRAHAM RL; JOHNSON DS et al.1978; S.I.A.M.J. APPL. MATH.; U.S.A.; DA. 1978; VOL. 34; NO 3; PP. 477-495; BIBL. 1 P. 1/2Article

"NATURAL" PROGRAMMING LANGUAGESALTON DA.1980; LONDON MATH. SOC. LECTURE NOTE SER.; GBR; DA. 1980; NO 45; PP. 248-285; BIBL. 4 P.Conference Paper

A COMPARISON OF MEASURES OF CONTROL FLOW COMPLEXITYBAKER AL; ZWEBEN SH.1979; COMPSAC 79. INTERNATIONAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE. 3/1979/CHICAGO IL; USA; NEW YORK: IEEE; DA. 1979; PP. 695-701; BIBL. 22 REF.Conference Paper

FAST ALGORITHM FOR SPARSE MATRIX MULTIPLICATIONSCHOOR A.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 15; NO 2; PP. 87-89; BIBL. 2 REF.Article

LOWER BOUNDS FOR THE CYCLE DETECTION PROBLEMFICH FE.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 96-105; BIBL. 4 REF.Conference Paper

A MODEL OF COMPUTATION FOR VLSI WITH RELATED COMPLEXITY RESULTSCHAZELLE B; MONIER L.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 318-325; BIBL. 14 REF.Conference Paper

TESTS DE PRIMALITEMIGNOTTE M.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 12; NO 1; PP. 109-117; ABS. ENG; BIBL. 7 REF.Article

LENGTH OF PREDICATE CALCULUS FORMULAS AS A NEW COMPLEXITY MEASUREIMMERMAN N.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. 337-347; BIBL. 15 REF.Conference Paper

ON THE SIMPLIFICATION OF CONSTRUCTIONS IN DEGREES OF INSOLVABILITY VIA COMPUTATIONAL COMPLEXITYDALEY RP.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 258-265; BIBL. 8 REF.Conference Paper

A CROSSING MEASURE FOR 2-TAPE TURING MACHINESWECHSUNG G.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 508-516; BIBL. 3 REF.Conference Paper

DIVIDE AND CONQUER FOR LINEAR EXPECTED TIME.BENTLEY JL; SHAMOS MI.1978; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1978; VOL. 7; NO 2; PP. 87-91; BIBL. 18 REF.Article

ON THE COMPLEXITY OF MULTIPLACED FUNCTIONS.HENNO J.1977; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1977; VOL. 13; NO 11; PP. 585-593; ABS. ALLEM. RUSSE; BIBL. 9 REF.Article

SELECTION OF GOOD ALGORITHMS FROM A FAMILY OF ALGORITHMS FOR POLYNOMIAL DERIVATIVE EVALUATION.SHAW M; TRAUB JF.1977; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1977; VOL. 6; NO 5; PP. 141-145; BIBL. 16 REF.Article

COMPLEXITY-CLASS-ENCODING STATES.LYNCH N.1976; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1976; VOL. 13; NO 1; PP. 100-118; BIBL. 15 REF.Article

COMBINED COMPLEXITY. A NEW DIRECTION IN COMPUTATIONAL COMPLEXITY.BREITBART Y; LEWIS FD.sdIN: CONF. INF. SCI. SYST. PROC.; BALTIMORE, MD.; 1977; BALTIMORE; JOHNS HOPKINS UNIV.; DA. S.D.; PP. 1-5; BIBL. 16 REF.Conference Paper

MEASURES OF PARALLELISM IN ALTERNATING COMPUTATION TREESKING KN.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 189-201; BIBL. 7 REF.Conference Paper

RECURSION AND COMPLEXITY THEORY ON CPO-SWEIHRAUCH K.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 104; PP. 195-202; BIBL. 15 REF.Conference Paper

STRAIGHT-LINE PROGRAM LENGTH AS A PARAMETER FOR COMPLEXITY ANALYSISLYNCH NA.1980; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1980; VOL. 21; NO 3; PP. 251-280; BIBL. 19 REF.Article

COMPLEXITY MEASURES AND HIERARCHIES FOR THE EVALUATION OF INTEGERS AND POLYNOMIALS.LIPTON RJ; DOBKIN D.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976 PARU 1977; VOL. 3; NO 3; PP. 349-357; BIBL. 10 REF.Article

STEADY-PACED-OUTPUT AND FRACTIONAL-ON-LINE ALGORITHMS ON A RAMMANACHER GK.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 15; NO 2; PP. 47-52; BIBL. 7 REF.Article

SEVERAL RESULTS IN PROGRAM SIZE COMPLEXITYKATSEFF HP; SIPSER M.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 15; NO 3; PP. 291-309; BIBL. 18 REF.Article

EIN ERFAHRUNGSBERICHT UEBER DIE IMPLEMENTATION EINES VERBESSERTEN KACHIJAN-ALGORITHMUS = RAPPORT D'APPLICATION SUR L'IMPLEMENTATION DE L'ALGORITHME DE KACHIJAN AMELIOREGASBER RB.1981; ANGEW. INFORM.; ISSN 0013-5704; DEU; DA. 1981; NO 11; PP. 502-505; ABS. ENG; BIBL. 7 REF.Article

SOME CONNECTIONS BETWEEN NONUNIFORM AND UNIFORM COMPLEXITY CLASSESKARP RM; LIPTON RJ.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 302-309; BIBL. 18 REF.Conference Paper