Complexité des systèmes et des processus = Process and systems complexityDO NGOC THANH, Bernard.Génie logiciel (1995). 2002, Num 62, pp 2-7, issn 1265-1397, 6 p.Article

New applications of the incompressibility method : Part IIBUHRMAN, H; TAO JIANG; MING LI et al.Theoretical computer science. 2000, Vol 235, Num 1, pp 59-70, issn 0304-3975Article

Algebras of minimal rank over arbitrary fieldsBLÄSER, Markus.Lecture notes in computer science. 2003, pp 403-414, issn 0302-9743, isbn 3-540-00623-0, 12 p.Conference Paper

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

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

On the space and time complexity of functions computable by simple programsTAT-HUNG CHAN; IBARRA, O. H.SIAM journal on computing (Print). 1983, Vol 12, Num 4, pp 708-716, issn 0097-5397Article

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

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

Complexity, ecology and the materiality of informationSMITH, John; JENKS, Chris.Theory, culture & society. 2005, Vol 22, Num 5, issn 0263-2764, 24 p., 141-163, 272 [24 p.]Article

On the time complexity for circumscribing a convex polygonWOO, T. C; HYUAN-CHAN LEE.Computer vision, graphics, and image processing. 1985, Vol 30, Num 3, pp 362-363, issn 0734-189XArticle

Universal quantifiers and time complexity of random access machinesGRANDJEAN, E.Mathematical systems theory. 1985, Vol 18, Num 2, pp 171-187, issn 0025-5661Article

Revisiting a result of KoCINTIOLI, P; SILVESTRI, R.Information processing letters. 1997, Vol 61, Num 4, pp 189-194, issn 0020-0190Article

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

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 space efficient distributive sortHANDLEY, C. C.Information processing letters. 1991, Vol 37, Num 2, pp 75-78, issn 0020-0190, 4 p.Article

A tight relationship between generic oracles and type-2 complexity theoryCOOK, S; IMPAGLIAZZO, R; YAMAKAMI, T et al.Information and computation (Print). 1997, Vol 137, Num 2, pp 159-170, issn 0890-5401Article

On the random oracle hypothesisKURTZ, S. A.Information and control. 1983, Vol 57, Num 1, pp 40-47, issn 0019-9958Article

Complexity classes between θ^p_k and Δ^p_kCASTRO, J; SEARA, C.Informatique théorique et applications (Imprimé). 1996, Vol 30, Num 2, pp 101-121, issn 0988-3754Conference Paper

Information distance and conditional complexitiesVYUGIN, Mikhail V.Theoretical computer science. 2002, Vol 271, Num 1-2, pp 145-150, issn 0304-3975Article

Uncomputably large integral points on algebraic plane curves?ROJAS, J. M.Theoretical computer science. 2000, Vol 235, Num 1, pp 145-162, issn 0304-3975Article

Descriptive complexity of computable sequencesDURAND, B; SHEN, A; VERESHAGIN, N et al.Lecture notes in computer science. 1999, pp 153-162, issn 0302-9743, isbn 3-540-65691-XConference Paper

A note on the density of oracle decreasing time-space complexityDURIS, P; ROLIM, J. D. P.Theoretical computer science. 1994, Vol 132, Num 1-2, pp 435-444, issn 0304-3975Article

Large sets in AC⁰ have many strings with low Kolmogorov complexityZIMAND, M.Information processing letters. 1997, Vol 62, Num 3, pp 165-170, issn 0020-0190Article

The contour problem for rectilinear polygonsWOOD, D.Information processing letters. 1984, Vol 19, Num 5, pp 229-236, issn 0020-0190Article