Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("KER I KO")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 21 of 21

  • Page / 1
Export

Selection :

  • and

Distinguishing conjunctive and disjunctive reducibilities by sparse setsKER-I KO.Information and computation (Print). 1989, Vol 81, Num 1, pp 62-87, issn 0890-5401Article

Reducibilities on real numbersKER-I KO.Theoretical computer science. 1984, Vol 31, Num 1-2, pp 101-123, issn 0304-3975Article

On the computational complexity of ordinary differential equationsKER-I KO.Information and control. 1983, Vol 58, Num 1-3, pp 157-194, issn 0019-9958Article

Separating and collapsing results on the relativized probabilistic polynomial-time hierarchyKER-I KO.Journal of the Association for Computing Machinery. 1990, Vol 37, Num 2, pp 415-438, issn 0004-5411, 24 p.Article

On helping by robust oracle machinesKER-I KO.Theoretical computer science. 1987, Vol 52, Num 1-2, pp 15-36, issn 0304-3975Article

On the continued fraction representation of computable real numbersKER-I KO.Theoretical computer science. 1986, Vol 47, Num 3, pp 299-313, issn 0304-3975Article

On self-reducibility and weak P-selectivityKER-I KO.Journal of computer and system sciences (Print). 1983, Vol 26, Num 2, pp 209-221, issn 0022-0000Article

On the complexity of learning minimum time-bounded Turing machinesKER-I KO.SIAM journal on computing (Print). 1991, Vol 20, Num 5, pp 962-986, issn 0097-5397Article

Nonlevelable sets and immune sets in the accepting density hierarchy in NPKER-I KO.Mathematical systems theory. 1985, Vol 18, Num 3, pp 189-205, issn 0025-5661Article

Identification of pattern languages from examples and queriesMARRON, A; KER-I KO.Information and computation (Print). 1987, Vol 74, Num 2, pp 91-112, issn 0890-5401Article

On circuit-size complexity and the low hierarchy in NPKER-I KO; SCHONING, U.SIAM journal on computing (Print). 1985, Vol 14, Num 1, pp 41-51, issn 0097-5397Article

Computing power series in polynomial timeKER-I KO; FRIEDMAN, H.Advances in applied mathematics (Print). 1988, Vol 9, Num 1, pp 40-50, issn 0196-8858Article

Advances in algorithms, languages and complexityDing-Zhu Du; Ker-I Ko.1997, isbn 0-7923-4396-4, XXXIV, 396 p, isbn 0-7923-4396-4Book

THE MAXIMUM VALUE PROBLEM AND NP REAL NUMBERSKER I KO.1982; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 1; PP. 15-35; BIBL. 15 REF.Article

On sets truth-table reducible to sparse setsBOOK, R. V; KER-I KO.SIAM journal on computing (Print). 1988, Vol 17, Num 5, pp 903-919, issn 0097-5397Article

A note on the two-variable pattern-finding problemKER-I KO; CHIN-MING HUA.Journal of computer and system sciences (Print). 1987, Vol 34, Num 1, pp 75-86, issn 0022-0000Article

On the number of queries necessary to identify a permutationKER-I KO; SHIA-CHUNG TENG.Journal of algorithms (Print). 1986, Vol 7, Num 4, pp 449-462, issn 0196-6774Article

COMPLETENESS, APPROXIMATION AND DENSITYKER I KO; MOORE D.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 4; PP. 787-796; BIBL. 16 REF.Article

Computational complexity of two-dimensional regionsCHOU, A. W; KER-I KO.SIAM journal on computing (Print). 1995, Vol 24, Num 5, pp 923-947, issn 0097-5397Article

On one-way functions and polynomial-time isomorphismsKER-I KO; LONG, T. J; DING-ZHU DU et al.Theoretical computer science. 1986, Vol 47, Num 3, pp 263-276, issn 0304-3975Article

Instance complexityORPONEN, P; KER-I KO; SCHÖNING, U et al.Journal of the Association for Computing Machinery. 1994, Vol 41, Num 1, pp 96-121, issn 0004-5411Article

  • Page / 1