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

TIME AND SPACE BOUNDED COMPLEXITY CLASSES AND BAND WIDTH CONSTRAINED PROBLEMS. (A SURVEY)MONIEN B; SUDBOROUGH IH.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 78-93; BIBL. 27 REF.Conference Paper

RELATIVIZING TIME AND SPACEBOOK RV; WILSON CB; XU MEIRUI et al.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 254-259; BIBL. 15 REF.Conference Paper

ASYMPTOTICALLY TIGHT BOUNDS ON TIME-SPACE TRADE-OFFS IN A PEBBLE GAMELENGAUER T; TARJAN RE.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 4; PP. 1087-1130; BIBL. 34 REF.Article

A GENERAL CLASS OF RESOURCE TRADEOFFSBENTLEY JL; BROWN DJ.1982; JOURNAL OF COMPUTER AND SYSTEM SCIENCES; ISSN 0022-0000; USA; DA. 1982; VOL. 25; NO 2; PP. 214-238; BIBL. 29 REF.Article

A NOTE ON STRUCTURE AND LOOKING BACK APPLIED TO THE RELATIVE COMPLEXITY OF COMPUTABLE FUNCTIONSCHEW P; MACHTEY M.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 1; PP. 53-59; BIBL. 2 REF.Article

A SPACE-OPTIMAL SOLUTION OF GENERAL REGION LOCATIONEDELSBRUNNER H; MAURER HA.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 16; NO 3; PP. 329-336; BIBL. 14 REF.Article

ACCESSIBILITY OF VALUES AS A DETERMINANT OF RELATIVE COMPLEXITY IN ALGEBRASLYNCH NA.1982; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 1; PP. 101-113; BIBL. 5 REF.Article

ON THE COMPUTATIONAL POWER OF AUTOMATA WITH TIME OR SPACE BOUNDED BY ACKERMANN'S OR SUPEREXPONENTIAL FUNCTIONSREN JI TAO.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 16; NO 2; PP. 115-148; BIBL. 11 REF.Article

A HOMOMORPHIC CHARACTERIZATION OF TIME AND SPACE COMPLEXITY CLASSES OF LANGUAGESCULIK K II; DIAMOND ND.1980; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1980; VOL. 8; NO 3; PP. 207-222; BIBL. 9 REF.Article

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

IL-22 : A critical mediator in mucosal host defenseAUJLA, S. J; KOLLS, J. K.Journal of molecular medicine (Berlin. Print). 2009, Vol 87, Num 5, pp 451-454, issn 0946-2716, 4 p.Article

NUMBER OF QUANTIFIERS IS BETTER THAN NUMBER OF TAPE CELLSIMMERMAN N.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 3; PP. 384-406; BIBL. 18 REF.Article

ON THE TIME-SPACE TRADEOFF FOR SORTING WITH LINEAR QUERIESCHI CHIH YAO A.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 19; NO 2; PP. 203-218; BIBL. 7 REF.Article

SORTING NUMBERS IN LINEAR EXPECTED TIME AND OPTIMAL EXTRA SPACEGONZALEZ TF; JOHNSON DB.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 15; NO 3; PP. 119-124; BIBL. 13 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

TWO FAMILIAR TRANSITIVE CLOSURE ALGORITHMS WHICH ADMIT NO POLYNOMIAL TIME, SUBLINEAR SPACE IMPLEMENTATIONSTOMPA M.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 333-338; BIBL. 17 REF.Conference Paper

SOME OBSERVATIONS ON NP REAL NUMBERS AND P-SELECTIVE SETSSELMAN AL.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 23; NO 3; PP. 326-332; BIBL. 11 REF.Article

A TIME-SPACE TRADEOFF FOR SORTING ON NON-OBLIVIOUS MACHINESBORODIN A; FISCHER MJ; KIRKPATRICK DG et al.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 3; PP. 351-364; BIBL. 18 REF.Article

COMPUTATION OF BILINEAR FORMS OVER FINITE FIELDSJA'JA' J.1980; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1980; VOL. 27; NO 4; PP. 822-830; BIBL. 11 REF.Article

ON TIME VERSUS SPACE IIPAUL W; REISCHUK R.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 3; PP. 312-327; BIBL. 11 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

SIGNAL COMPLEXITY, RESPONSE COMPLEXITY, AND SIGNAL SPECIFICATION IN VIGILANCE.CHILDS JM.1976; HUM. FACTORS; U.S.A.; DA. 1976; VOL. 18; NO 2; PP. 149-160; BIBL. 36 REF.Article

DEGREES OF COMPUTATIONAL COMPLEXITY = DEGRES DE COMPLEXITE DE CALCULENDERTON HB.1972; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1972; VOL. 6; NO 5; PP. 389-396; BIBL. 10 REF.Serial Issue

SUR LA COMPLEXITE DE CERTAINS POLYNOMES.HYAFIL L; VAN DE WIELE JP.1975; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1975; NO 100; PP. 1-22; ABS. ANGL.; BIBL. DISSEM.Article