Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Complexité calcul")

Filter

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

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 14732

  • Page / 590

Export

Selection :

  • and

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

A method of constructing selection networks with O(log n) depthJIMBO, S; MARUOKA, A.SIAM journal on computing (Print). 1996, Vol 25, Num 4, pp 709-739, issn 0097-5397Article

Using Complexity to Protect ElectionsFALISZEWSKI, Piotr; HEMASPAANDRA, Edith; HEMASPAANDRA, Lane A et al.Communications of the ACM. 2010, Vol 53, Num 11, issn 0001-0782, 74-82 [8 p.]Article

Epistemic virtues, metavirtues, and computational complexityMORTON, Adam.Noûs (Bloomington, Indiana). 2004, Vol 38, Num 3, pp 481-502, issn 0029-4624, 22 p.Article

Parameterized complexity: The main ideas and some research frontiersFELLOWS, Michael R.Lecture notes in computer science. 2001, pp 291-307, issn 0302-9743, isbn 3-540-42985-9Conference Paper

A polynomial jumpoperatorTOWNSEND, M.Information and control. 1986, Vol 68, Num 1-3, pp 146-169, issn 0019-9958Article

Quantum query complexity in computational geometry revisitedBAHADUR, A; DORR, C; LAFAYE, T et al.Proceedings of SPIE, the International Society for Optical Engineering. 2006, pp 624413.1-624413.7, issn 0277-786X, isbn 0-8194-6300-0, 1VolConference Paper

On a relation between uniform coding and problems of the form DTIMEF(F) =? DSPACEF(F)CAPORASO, S; ZITO, M.Acta informatica. 1998, Vol 35, Num 8, pp 665-672, issn 0001-5903Article

Panty OBDDs cannot be handled efficiently enoughLÖBBING, M; SIELING, D; WEGENER, I et al.Information processing letters. 1998, Vol 67, Num 4, pp 163-168, issn 0020-0190Article

Refining nondeterminism in relativizations of complexity classesXU MEL-RUI; DONER, J. E; BOOK, R. V et al.Journal of the Association for Computing Machinery. 1983, Vol 30, Num 3, pp 677-685, issn 0004-5411Article

Fast parallel matrix and GCD computationsBORODIN, A; VON ZUR GATHEN, J; HOPCROFT, J et al.Information and control. 1982, Vol 52, Num 3, pp 241-256, issn 0019-9958Article

A short note on some tractable cases of the satisfiability problemVAN MAAREN, H.Information and computation (Print). 2000, Vol 158, Num 2, pp 125-130, issn 0890-5401Article

Atomic snapshots in O(n log n) operationsATTIYA, H; RACHMAN, O.SIAM journal on computing (Print). 1998, Vol 27, Num 2, pp 319-340, issn 0097-5397Article

The bit complexity of the predecessor problemAFEK, Y; COHEN, M; HAALMAN, E et al.Information processing letters. 1997, Vol 63, Num 2, pp 109-112, issn 0020-0190Article

Route selection with multiple metricsBAGCHI, A.Information processing letters. 1997, Vol 64, Num 4, pp 203-205, issn 0020-0190Article

Data editing and imputation from a computational point of viewWILLENBORG, L. C. R. J.Statistica neerlandica. 1995, Vol 49, Num 2, pp 139-151, issn 0039-0402Article

Notes on Gröbner basesMISHRA, B; CHEE YAP.Information sciences. 1989, Vol 48, Num 3, pp 219-252, issn 0020-0255, 34 p.Article

Correction to «computational complexity of algebraic functions»PIPPENCER, N.Journal of computer and system sciences (Print). 1988, Vol 37, Num 3, pp 395-399, issn 0022-0000Article

Relativized polynomial hierarchies extending two levelsHELLER, H.Mathematical systems theory. 1984, Vol 17, Num 2, pp 71-84, issn 0025-5661Article

Time-space trade-offs for some algebraic problemsJA'JA', J.Journal of the Association for Computing Machinery. 1983, Vol 30, Num 3, pp 657-667, issn 0004-5411Article

A note on parallel complexity of maximum f-matchingDESSMARK, A; GARRIDO, O; LINGAS, A et al.Information processing letters. 1998, Vol 65, Num 2, pp 107-109, issn 0020-0190Article

Test sequence generation from the protocol data portion based on the Selecting Chinese Postman algorithmCHEN, W.-H.Information processing letters. 1998, Vol 65, Num 5, pp 261-268, issn 0020-0190Article

1994 Workshop on logic and computational complexity. Part 1Information and computation (Print). 1998, Vol 140, Num 1, issn 0890-5401, 94 p.Serial Issue

A tight relationship between generic oracles and type-2 complexity theoryCOOK, S; IMPAGLIAZZO, R; YAMAKAMI, T et al.Information and computation (Print). 1997, Vol 137, Num 2, pp 159-170, issn 0890-5401Article

Finding extremal sets in less than quadratic timeYELLIN, D. M; JUTLA, C. S.Information processing letters. 1993, Vol 48, Num 1, pp 29-34, issn 0020-0190Article

  • Page / 590