Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("MACHINE ORACLE")

Results 1 to 5 of 5

  • Page / 1
Export

Selection :

  • and

ON LANGUAGES ACCEPTED BY SPACE-BOUNDED ORACLE MACHINESBOOK RV.1979; ACTA INFORMAT.; DEU; DA. 1979; VOL. 12; NO 2; PP. 177-185; BIBL. 13 REF.Article

COMPLEXITY CLASSES OF FORMAL LANGUAGES (PRELIMINARY REPORT)BOOK RV.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 43-56; BIBL. 24 REF.Conference Paper

On restricting the size of oracles compared with restricting access to oraclesLONG, T. J.SIAM journal on computing (Print). 1985, Vol 14, Num 3, pp 585-597, issn 0097-5397Article

On relativized nondeterministic polynomial-time bounded computationsLI XIANG.International journal of computer mathematics. 1985, Vol 17, Num 2, pp 151-153, issn 0020-7160Article

Quantitative relativizations of complexity classesBOOK, R. V; LONG, T. J; SELMAN, A. L et al.SIAM journal on computing (Print). 1984, Vol 13, Num 3, pp 461-487, issn 0097-5397Article

  • Page / 1