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

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

Efficient algorithms for computing the maximum distance between two finite planar setsBHATTACHARYA, B. K; TOUSSAINT, G. T.Journal of algorithms (Print). 1983, Vol 4, Num 2, pp 121-136, issn 0196-6774Article

Optimal enclosing regions in planar graphsBIENSTOCK, D; MONMA, C. L.Networks (New York, NY). 1989, Vol 19, Num 1, pp 79-94, issn 0028-3045, 16 p.Article

Lower bounds for the cycle detection problemFICH, F. E.Journal of computer and system sciences (Print). 1983, Vol 26, Num 3, pp 392-409, issn 0022-0000Article

The complexity of incremental convex hull algorithms in RdKALLAY, M.Information processing letters. 1984, Vol 19, Num 4, issn 0020-0190, 197Article

New directions and new challenges in algorithm design and complexity, parameterizedFELLOWS, Michael R.Lecture notes in computer science. 2003, pp 505-519, issn 0302-9743, isbn 3-540-40545-3, 15 p.Conference Paper

Finding hamiltonian circuits in proper interval graphsBERTOSSI, A. A.Information processing letters. 1983, Vol 17, Num 2, pp 97-101, issn 0020-0190Article

Revisiting a result of KoCINTIOLI, P; SILVESTRI, R.Information processing letters. 1997, Vol 61, Num 4, pp 189-194, issn 0020-0190Article

The NP-completeness column: an ongoing guideJOHNSON, D. S.Journal of algorithms (Print). 1983, Vol 4, Num 3, pp 286-300, issn 0196-6774Article

Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fieldsFITCHAS, N; GALLIGO, A; MORGENSTERN, J et al.Journal of pure and applied algebra. 1990, Vol 67, Num 1, pp 1-14, issn 0022-4049, 14 p.Article

Incremental condition estimationBISCHOF, C. H.SIAM journal on matrix analysis and applications. 1990, Vol 11, Num 2, pp 312-322, issn 0895-4798, 11 p.Article

O(n2) algorithms for graph planarizationJAYAKUMAR, R; THULASIRAMAN, K; SWAMY, M. N. S et al.IEEE transactions on computer-aided design of integrated circuits and systems. 1989, Vol 8, Num 3, pp 257-267, issn 0278-0070, 11 p.Article

Parallel algorithms for cographs and parity graphs wirth applicationsADHAR, G. S; PENG, S.Journal of algorithms (Print). 1990, Vol 11, Num 2, pp 252-284, issn 0196-6774, 33 p.Article

A reliable algorithm to compute the spectral set of a polytope of polynomials to prescribed accuracyPALURI, Nataraj S. V; BARVE, Jayesh J.Journal of dynamic systems, measurement, and control. 2006, Vol 128, Num 2, pp 400-405, issn 0022-0434, 6 p.Article

Quantified constraints: Algorithms and complexityBÖRNER, Ferdinand; BULATOV, Andrei; JEAVONS, Peter et al.Lecture notes in computer science. 2003, pp 58-70, issn 0302-9743, isbn 3-540-40801-0, 13 p.Conference Paper

Query learning of bounded-width OBDDsNAKAMURA, A.Theoretical computer science. 2000, Vol 241, Num 1-2, pp 83-114, issn 0304-3975Article

A definition of discovery in terms of generalized descriptional complexityBANNAI, H; MIYANO, S.Lecture notes in computer science. 1999, pp 316-318, issn 0302-9743, isbn 3-540-66713-XConference Paper

A note on minimizing submodular functionsNAGAMOCHI, H; IBARAKI, T.Information processing letters. 1998, Vol 67, Num 5, pp 239-244, issn 0020-0190Article

Theoretical aspects of computer softwareHAGIYA, Masami.Information and computation (Print). 1996, Vol 125, Num 2, pp 77-170, issn 0890-5401Serial Issue

On the complexity of certified write-all algorithmsMARTEL, C; SUBRAMONIAN, R.Journal of algorithms (Print). 1994, Vol 16, Num 3, pp 361-387, issn 0196-6774Article

Fast two-dimensional pattern matchingBAEZA-YATES, R; REGNIER, M.Information processing letters. 1993, Vol 45, Num 1, pp 51-57, issn 0020-0190Article

Generalized string matchingABRAHAMSON, K.SIAM journal on computing (Print). 1987, Vol 16, Num 6, pp 1039-1051, issn 0097-5397Article

An optimization problem on graphsDING-ZHU DY.Discrete applied mathematics. 1986, Vol 14, Num 1, pp 101-104, issn 0166-218XArticle

Forme de Frobenius d'une matrice = The Frobenius normal form of a matrixOZELLO, Patrick.Rapport de recherche - IMAG. 1986, Num 578, issn 0750-7380, 26 p.Report

A personnel assignment problemRAMANAN, P; DEOGUN, J. S; LIU, C. L et al.Journal of algorithms (Print). 1984, Vol 5, Num 1, pp 132-144, issn 0196-6774Article

  • Page / 233