Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("CLASSE COMPLEXITE")

Document Type [dt]

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

Publication Year[py]

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

Discipline (document) [di]

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

Language

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

Author Country

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

Results 1 to 25 of 925

  • Page / 37
Export

Selection :

  • and

THE NON-RENAMEABILITY OF HONESTY CLASSES.VAN EMDE BOAS P.1975; COMPUTING; AUSTR.; DA. 1975; VOL. 14; NO 1-2; PP. 183-193; ABS. ALLEM.; BIBL. 12 REF.Article

AN EFFICIENT GENERAL PURPOSE PARALLEL COMPUTERGALIL Z; PAUL WJ.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 247-262; BIBL. 33 REF.Conference Paper

A UNIFORM APPROACH TO OBTAIN DIAGONAL SETS IN COMPLEXITY CLASSESSCHOENING U.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 18; NO 1; PP. 95-103; BIBL. 13 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

P-SELECTIVE SETS, TALLY LANGUAGES, AND THE BEHAVIOR OF POLYNOMIAL TIME REDUCIBILITIES ON NPSELMAN AL.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 71; PP. 546-555; BIBL. 15 REF.Conference Paper

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

BOUNDED RECURSION AND COMPLEXITY CLASSESWAGNER K.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 492-498; BIBL. 6 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

A CIRCUIT-SIZE LOWER BOUNDKANNAN R.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 304-309; BIBL. 13 REF.Conference Paper

ON THE COMPLETENESS IN ABSTRACT COMPLEXITY CLASSES OF LANGUAGESGRIGORAS G.1980; AM. STI. UNIV. "AL. I. CUZA" IASI, 1A; ROM; DA. 1980; VOL. 26; NO 1; PP. 173-177; BIBL. 6 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

DATA COMPRESSION VIA TEXTUAL SUBSTITUTIONSTORER JA; SZYMANSKI TG.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 4; PP. 928-951; BIBL. 39 REF.Article

PARALLEL RANDOM ACCESS MACHINES WITH POWERFUL INSTRUCTION SETSSAVITCH W.1982; MATH. SYST. THEORY; ISSN 0025-5661; DEU; DA. 1982; VOL. 15; NO 3; PP. 191-210; BIBL. 14 REF.Article

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

TOWARDS SEPARATING NONDETERMINISTIC TIME FROM DETERMINISTIC TIMEKANNAN R.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 235-243; BIBL. 15 REF.Conference Paper

A CHARACTERIZATION OF THE CLASS OF FUNCTIONS COMPUTABLE IN POLYNOMIAL TIME ON RANDOM ACCESS MACHINESBERTONI A; MAURI G; SABADINI N et al.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK; ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 168-176; BIBL. 17 REF.Conference Paper

RELATIVE SUCCINCTNESS OF REPRESENTATIONS OF LANGUAGES AND SEPARATION OF COMPLEXITY CLASSESHARTMANIS J; BAKER TP.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 70-88; BIBL. 11 REF.Conference Paper

A RELATION BETWEEN SPACE, RETURN AND DUAL RETURN COMPLEXITIESWECHSUNG G; BRANDSTAEDT A.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 9; NO 1; PP. 127-140; BIBL. 9 REF.Article

LIMITATIONS ON SEPARATING NONDETERMINISTIC COMPLEXITY CLASSESRACKOFF CW; SEIFERAS JI.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 4; PP. 742-745; BIBL. 5 REF.Article

TWO TYPES OF PROPERTIES FOR COMPLEXITY MEASURESLISCHKE G.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 3; PP. 123-126; BIBL. 12 REF.Article

ON RELATIVIZATION AND THE EXISTENCE OF COMPLETE SETSSIPSER M.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 523-531; BIBL. 4 REF.Conference Paper

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

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

SYMMETRIC SPACE-BOUNDED COMPUTATIONLEWIS HR; PADIMITRIOU CH.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 374-384; BIBL. 17 REF.Conference Paper

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

  • Page / 37