Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Computational complexity")

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 14571

  • Page / 583

Export

Selection :

  • and

Phutball is PSPACE-hardDERENIOWSKI, Dariusz.Theoretical computer science. 2010, Vol 411, Num 44-46, pp 3971-3978, issn 0304-3975, 8 p.Article

Introduction of quantum computing from the computer science perspective and reviewing activities : Quantum information technologyFORTNOW, Lance.NEC research & development. 2003, Vol 44, Num 3, pp 268-272, issn 0547-051X, 5 p.Article

A simple proof that optimality theory is computationally intractableIDSARDI, William J.Linguistic inquiry. 2006, Vol 37, Num 2, pp 271-275, issn 0024-3892, 5 p.Article

A finite set of functions with an EXPTIME-complete composition problemKOZIK, Marcin.Theoretical computer science. 2008, Vol 407, Num 1-3, pp 330-341, issn 0304-3975, 12 p.Article

Tight bounds on pluralitySRIVASTAVA, Nikhil; TAYLOR, Alan D.Information processing letters. 2005, Vol 96, Num 3, pp 93-95, issn 0020-0190, 3 p.Article

On the resolution-based family of abstract argumentation semantics and its grounded instanceBARONI, P; DUNNE, P. E; GIACOMIN, M et al.Artificial intelligence (General ed.). 2011, Vol 175, Num 3-4, pp 791-813, issn 0004-3702, 23 p.Article

Refinement of the alternating space hierarchyGEFFERT, Viliam; POPELY, Norbert.Computing and informatics. 2002, Vol 21, Num 6, pp 607-616, issn 1335-9150, 10 p.Article

On the computational complexity of cost efficiency analysis modelsJAHANSHAHLOO, G. R; SOLEIMANI-DAMANEH, M; MOSTAFAEE, A et al.Applied mathematics and computation. 2007, Vol 188, Num 1, pp 638-640, issn 0096-3003, 3 p.Article

Non-mitotic setsGLASSER, Christian; SELMAN, Alan L; TRAVERS, Stephen et al.Theoretical computer science. 2009, Vol 410, Num 21-23, pp 2011-2023, issn 0304-3975, 13 p.Article

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

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

Extracting Computational Entropy and Learning Noisy Linear FunctionsLEE, Chia-Jung; LU, Chi-Jen; TSAI, Shi-Chun et al.IEEE transactions on information theory. 2011, Vol 57, Num 8, pp 5485-5496, issn 0018-9448, 12 p.Article

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

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

The history of complexityFORTNOW, Lance.Proceedings - IEEE Conference on Computational Complexity. 2002, issn 1093-0159, isbn 0-7695-1468-5, p. 61Conference Paper

Space Hierarchy Theorem revisedGEFFERT, Viliam.Lecture notes in computer science. 2001, pp 387-397, issn 0302-9743, isbn 3-540-42496-2Conference Paper

On the comparison complexity of the string prefix-matching problemBRESLAUER, D; COLUSSI, L; TONIOLO, L et al.Journal of algorithms (Print). 1998, Vol 29, Num 1, pp 18-67, issn 0196-6774Article

Perfectly secure key distribution for dynamic conferencesBLUNDO, C; DE SANTIS, A; HERZBERG, A et al.Information and computation (Print). 1998, Vol 146, Num 1, pp 1-23, issn 0890-5401Article

  • Page / 583