Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("COMPLEXITE ALGORITHME")

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 5905

  • Page / 237

Export

Selection :

  • and

PRIORITY QUEUES WITH UPDATE AND FINDING MINIMUM SPANNING TREES.JOHNSON DB.1975; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1975; VOL. 4; NO 3; PP. 53-57; BIBL. 10 REF.Article

SYSTEMES CONSISTANTS DE REPRESENTANTS DISTINCTS POUR UNE FAMILLE DE SOUS-ENSEMBLES D'UN ENSEMBLE FINIASRATYAN AS.1975; DISKRETN. ANAL.; S.S.S.R.; DA. 1975; NO 27; PP. 3-12; BIBL. 6 REF.Article

A UNIFIED VIEW OF THE COMPLEXITY OF EVALUATION AND INTERPOLATION.HOROWITZ E.1974; ACTA INFORMAT.; ALLEM.; DA. 1974; VOL. 3; NO 2; PP. 123-133; BIBL. 12 REF.Article

SELECTING THE TOP THREE ELEMENTSAIGNER M.1982; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1982; VOL. 4; NO 4; PP. 247-267; BIBL. 6 REF.Article

ON THE AVERAGE-CASE COMPLEXITY OF "BUCKETING" ALGORITHMSAKL SG; MEIJER H.1982; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1982; VOL. 3; NO 1; PP. 9-13; BIBL. 15 REF.Article

TESTING FOR THE CHURCH-ROSSER PROPERTYBOOK RV; O'DUNLAING CP.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 16; NO 2; PP. 223-229; BIBL. 12 REF.Article

COMPLEXITE DE QUELQUES ALGORITHMES DE THEORIE DES GRAPHES.BERSTEL J.1976; IN: ANAL. APPL. INF. JOURN. COMB. INF.; BORDEAUX; 1975; BORDEAUX; UNIV. BORDEAUX I; DA. 1976; PP. 31-39; ABS. ANGL.; BIBL. 1 P. 1/2Conference Paper

LES PROBLEMES DE GRAPHE ET LA COMPLEXITE DES ALGORITHMES.ARDITTI JC.1976; IN: ANAL. APPL. INF. JOURN. COMB. INF.; BORDEAUX; 1975; BORDEAUX; UNIV. BORDEAUX I; DA. 1976; PP. 7-22; ABS. ANGL.; BIBL. 7 REF.Conference Paper

COMPLEXITE DE LA SOLUTION APPROCHEE DES PROBLEMES COMBINATOIRESNIGMATULLIN RG.1975; DOKL. AKAD. NAUK S.S.S.R.; S.S.S.R.; DA. 1975; VOL. 224; NO 2; PP. 289-292; BIBL. 9 REF.Article

CONSTRUCTION DE DEKKER ET NON-RECURSIVITE EFFECTIVEKANOVICH MI.1975; DOKL. AKAD. NAUK S.S.S.R.; S.S.S.R.; DA. 1975; VOL. 222; NO 5; PP. 1028-1030; BIBL. 10 REF.Article

SYNTHESE FORMELLE ET REALISATION DES AUTOMATES A PARTIR DES CIRCUITS HOMOGENES STANDARDMISHCHENKO AT.1974; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1974; NO 5; PP. 15-22; BIBL. 9 REF.Article

COMPUTING RATIONAL ZEROS OF INTEGRAL POLYNOMIALS BY P-ADIC EXPANSIONLOOS R.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 2; PP. 286-293; BIBL. 10 REF.Article

VLSI ALGORITHMS FOR THE CONNECTED COMPONENT PROBLEMHAMBRUSCH SE.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 2; PP. 354-365; BIBL. 16 REF.Article

COMPLEXITE ALGORITHMIQUE DE LA THEORIE DE DEUX BIJECTIONS QUI COMMUTENT = ALGORITHMIC COMPLEXITY OF THE THEORY OF TWO COMMUTING BIJECTIONSPELZ ELIZABETH.1982; ; FRA; DA. 1982; 48 P.; 30 CM; BIBL. 1 P.; TH. 3E CYCLE: MATH./PARIS 7/1982Thesis

TWO REMARKS ON A CONVEX HULL ALGORITHMAKL SG.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 2; PP. 108-109; BIBL. 1 REF.Article

COMPLEXITY OF THE UNIFICATION ALGORITHM FOR FIRST-ORDER EXPRESSIONS.VENTURINI ZILLI M.1975; CALCOLO; ITAL.; DA. 1975; VOL. 12; NO 4; PP. 361-371; BIBL. 4 REF.Article

ESTIMATING THE QUALITY OF COMPUTATIONAL ALGORITHMS. I.BARBENKO KI.1975; COMPUTER METHODS APPL. MECH. ENGNG; NETHERL.; DA. 1975; VOL. 7; NO 1; PP. 47-73; BIBL. 16 REF.Article

AN ALGORITHM FOR FINDING ALL SHORTEST PATHS USING N2.81 INFINITE-PRECISION MULTIPLICATIONS.YUVAL G.1976; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1976; VOL. 4; NO 6; PP. 155-156; BIBL. 4 REF.Article

ON THE COMPLEXITY OF COMPARISON PROBLEMS USING LINEAR FUNCTIONS.CHI CHIH YAO A.1975; IN: ANNU. SYMP. FOUND. COMPUT. SCI. 16; BERKELEY, CALIF.; 1975; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1975; PP. 85-89; BIBL. 14 REF.Conference Paper

MINIMUM S-T CUT OF A PLANAR UNDIRECTED NETWORK IN O(N LOG2(N)) TIMEREIF JH.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 1; PP. 71-81; BIBL. 13 REF.Article

THE COMPLEXITY OF SELECTION AND RANKING IN X+Y AND MATRICES WITH SORTED COLUMNSFREDERICKSON GN; JOHNSON DB.1982; JOURNAL OF COMPUTER AND SYSTEM SCIENCES; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 2; PP. 197-208; BIBL. 8 REF.Article

AN ALGORITHM FOR THE TWO DIMENSIONAL FFT.HOYER EA; BERRY WR.1977; IN: INT. CONF. ACOUST. SPEECH SIGNAL PROCESS.; HARTFORD, CONN.; 1977; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1977; PP. 552-555; BIBL. 5 REF.Conference Paper

CONVEX DECOMPOSITIONS OF POLYHEDRACHAZELLE BM.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. 70-79; BIBL. 8 REF.Conference Paper

ON THE CONJECTURE RELATING MINIMAX AND MINIMEAN COMPLEXITY NORMSRUZICKA P; WIEDERMANN J.1979; APL. MAT.; CSK; DA. 1979; VOL. 24; NO 5; PP. 321-325; ABS. SLO; BIBL. 3 REF.Article

COMPLEXITE DES TESTS SERVANT AU CONTROLE DU FONCTIONNEMENT DES ENTREES DES CIRCUITS LOGIQUESNOSKOV VN.1975; DISKRETN. ANAL.; S.S.S.R.; DA. 1975; NO 27; PP. 23-51; BIBL. 9 REF.Article

  • Page / 237