Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("ALGORITHM COMPLEXITY")

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

Origin

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

Results 1 to 25 of 5805

  • Page / 233

Export

Selection :

  • and

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

A PERFORMANCE ANALYSIS OF A SIMPLE PRIME-TESTING ALGORITHMWUNDERLICH MC.1983; MATHEMATICS OF COMPUTATION; ISSN 0025-5718; USA; DA. 1983; VOL. 40; NO 162; PP. 709-714; BIBL. 7 REF.Article

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

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

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

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 DETERMINATION OF THE VALUE OF RADO'S NONCOMPUTABLE FUNCTION SIGMA (K) FOR FOUR-STATE TURING MACHINESBRADY AH.1983; MATHEMATICS OF COMPUTATION; ISSN 0025-5718; USA; DA. 1983; VOL. 40; NO 162; PP. 647-665; BIBL. 9 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

ANALYSIS OF AN ALGORITHM FOR COMPOSITION OF BINARY QUADRATIC FORMSILIOPOULOS CS.1982; JOURNAL OF ALGORITHMS; ISSN 0196-6774; USA; DA. 1982; VOL. 3; NO 2; PP. 157-159; BIBL. 5 REF.Article

FAST CANONIZATION OF CIRCULAR STRINGSSHILOACH Y.1981; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1981; VOL. 2; NO 2; PP. 107-121; BIBL. 5 REF.Article

A FAST ALGORITHM FOR COMPUTING LONGEST COMMON SUBSEQUENCES.HUNT JW; SZYMANSKI TG.1977; COMMUNIC. A.C.M.; U.S.A.; DA. 1977; VOL. 20; NO 5; PP. 350-353; BIBL. 7 REF.Article

BORNES INFERIEURES POUR LE PRODUIT MATRICIEL. ETUDE DE QUELQUES CAS.COFFY J.1975; ; S.L.; DA. 1975; PP. (66P.); H.T. 7; BIBL. 7 REF.; (THESE DOCT. 3E. CYCLE, SPEC. MATH., MENTION INF. ALGEBRIQUE; PARIS VIIThesis

TOWARDS A GENUINELY POLYNOMIAL ALGORITHM FOR LINEAR PROGRAMMINGMEGIDDO N.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 2; PP. 347-353; BIBL. 12 REF.Article

A FAST ALGORITHM FOR DETERMINING THE COMPLEXITY OF A BINARY SEQUENCE WITH PERIOD 2NGAMES RA; HUI CHAN A.1983; IEEE TRANSACTIONS ON INFORMATION THEORY; ISSN 0018-9448; USA; DA. 1983; VOL. 29; NO 1; PP. 144-146; BIBL. 4 REF.Article

ALGORITHMICAL COMPLEXITY OF SOME STATISTICAL DECISION PROCESS. IISINDELAR J.1980; KYBERNETIKA; ISSN 0023-5954; CSK; DA. 1980; VOL. 16; NO 4; PP. 357-376; BIBL. 4 REF.Article

FAST MATRIX MULTIPLICATION WITHOUT APA-ALGORITHMSPAN V.1982; COMPUT. MATH. WITH APPL.; ISSN 0097-4943; USA; DA. 1982; VOL. 8; NO 5; PP. 343-366; BIBL. 25 REF.Article

A NEW LINEAR ALGORITHM FOR INTERSECTING CONVEX POLYGONSO'ROURKE J; CHI BIN CHIEN; OLSON T et al.1982; COMPUT. GRAPH. IMAGE PROCESS.; ISSN 0146-664X; USA; DA. 1982; VOL. 19; NO 4; PP. 384-391; BIBL. 5 REF.Article

HOW TO REDUCE THE AVERAGE COMPLEXITY ON CONVEX HULL FINDING ALGORITHMSDEVROYE L.1981; COMPUT. MATH. WITH APPL.; ISSN 0097-4943; USA; DA. 1981; VOL. 7; NO 4; PP. 299-308; BIBL. 28 REF.Article

A MINIMUM SPANNING ELLIPSE ALGORITHMPOST MJ.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 115-122; BIBL. 5 REF.Conference Paper

A NOTE ON FINDING CONVEX HULLS VIA MAXIMAL VECTORSDEVROYE L.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 11; NO 1; PP. 53-56; BIBL. 11 REF.Article

  • Page / 233