Some consequences of non-uniform conditions on uniform classesYAP, C. K.Theoretical computer science. 1983, Vol 26, Num 3, pp 287-300, issn 0304-3975Article

Bandwidth constraints on problems complete for polynomial timeSUDBOROUGH, I. H.Theoretical computer science. 1983, Vol 26, Num 1-2, pp 25-52, issn 0304-3975Article

Admissible representations of effective cpo'sWEIHRAUCH, K; SCHÄFER, G.Theoretical computer science. 1983, Vol 26, Num 1-2, pp 131-147, issn 0304-3975Article

On the arithmetic complexicity of matrix Kronecker powersSEROUSSI, G; MA, F.Information processing letters. 1983, Vol 17, Num 3, pp 145-148, issn 0020-0190Article

Perfect stables in graphsCROITORU, C; SUDITU, E.Information processing letters. 1983, Vol 17, Num 1, pp 53-56, issn 0020-0190Article

Computing sums of order-K Fibonacci numbers in log timeER, M. C.Information processing letters. 1983, Vol 17, Num 1, pp 1-5, issn 0020-0190Article

On the computability of circumscriptionKRISHNAPRASAD, T.Information processing letters. 1988, Vol 27, Num 5, pp 237-243, issn 0020-0190Article

Completeness results for conflict-free vector replacement systemsHOWELL, R. R; ROSIER, L. E.Journal of computer and system sciences (Print). 1988, Vol 37, Num 3, pp 349-366, issn 0022-0000Article

A view of computability on term algebrasVENKATARAMAN, K. N; YASUHARA, A; HAWRUSIK, F. M et al.Journal of computer and system sciences (Print). 1983, Vol 26, Num 3, pp 410-471, issn 0022-0000Article

Polynomial time computations in models of ETJOSEPH, D.Journal of computer and system sciences (Print). 1983, Vol 26, Num 3, pp 311-338, issn 0022-0000Article

Log-logarithmic worst-case range queries are possible in space Θ (N)WILLARD, D. E.Information processing letters. 1983, Vol 17, Num 2, pp 81-84, issn 0020-0190Article

Comments on: the computation of the convex hull of a simple polygon in linear timeELGINDY, H.Computers and artificial intelligence. 1987, Vol 6, Num 5, pp 437-440, issn 0232-0274Article

A COMBINATORIAL APPROACH TO POLYGON SIMILARITYAVIS D; ELGINDY H.1983; IEEE TRANSACTIONS ON INFORMATION THEORY; ISSN 0018-9448; USA; DA. 1983; VOL. 29; NO 1; PP. 148-150; BIBL. 15 REF.Article

RELATIONS ENTRE LES DIFFERENTS TYPES DE CALCULABILITE RELATIVE DES FONCTIONSPOLYAKOV EA; ROZINAS MG.1978; MAT. SBOR; SUN; DA. 1978; VOL. 107; NO 1; PP. 134-145; BIBL. 11 REF.Article

Technical note: cubic nervesBEZ, H. E.Computer-aided design. 1985, Vol 17, Num 8, pp 367-368, issn 0010-4485Article

BUSY BEAVER SETS: CHARACTERIZATIONS AND APPLICATIONSDALEY RP.1982; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1982; VOL. 52; NO 1; PP. 52-67; BIBL. 10 REF.Article

Correction to «computational complexity of algebraic functions»PIPPENCER, N.Journal of computer and system sciences (Print). 1988, Vol 37, Num 3, pp 395-399, issn 0022-0000Article

A lower bound for polynomial multiplicationKAMINSKI, M.Theoretical computer science. 1985, Vol 40, Num 2-3, pp 319-322, issn 0304-3975Article

Überlegungen zu Rechenzeit und Speicherplatz fur spärlich besetzte Matrizen und Systemzerlegungen in Macros. II = Considérations sur le temps de calcul et l'espace mémoire des matrices éparses et du déchirement de système dans les macrosSPIRO, H.Elektronische Rechenanlagen. 1983, Vol 25, Num 4, pp 178-188, issn 0013-5720Article

CHARACTERIZATION OF DIVISION ALGEBRAS OF MINIMAL RANK AND THE RANK AND THE STRUCTURE OF THEIR ALGORITHM VARIETIESDE GROOTE HF.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 1; PP. 101-117; BIBL. 13 REF.Article

ON THE STRUCTURE OF LAPLACIEN DE ₂^PSCHOENING U.1983; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1983; VOL. 16; NO 4; PP. 209-211; BIBL. 5 REF.Article

Effective choice functions and index setsOWINGS, J. C. JR.Journal of computer and system sciences (Print). 1986, Vol 32, Num 3, pp 370-373, issn 0022-0000Article

Fast parallel computation of polynomials using few processorsVALIANT, L. G; SKYUM, S; BERKOWITZ, S et al.SIAM journal on computing (Print). 1983, Vol 12, Num 4, pp 641-644, issn 0097-5397Article

Graph traversal techniques and the maximum flow problem in distributed computationTO-YAT CHEUNG.IEEE transactions on software engineering. 1983, Vol 9, Num 4, pp 504-512, issn 0098-5589Article

RAPID MULTIPLICATION OF RECTANGULAR MATRICESCOPPERSMITH D.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 3; PP. 467-471; BIBL. 4 REF.Article