Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Computing 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

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 polynomial jumpoperatorTOWNSEND, M.Information and control. 1986, Vol 68, Num 1-3, pp 146-169, issn 0019-9958Article

On the power of two-local random reductions = Sur la pouvoir de la double réduction locale aléatoireFORTNOW, L; SZEGEDY, M.Information processing letters. 1992, Vol 44, Num 6, pp 303-306, issn 0020-0190Article

On the random oracle hypothesisKURTZ, S. A.Information and control. 1983, Vol 57, Num 1, pp 40-47, issn 0019-9958Article

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

On the time complexity for circumscribing a convex polygonWOO, T. C; HYUAN-CHAN LEE.Computer vision, graphics, and image processing. 1985, Vol 30, Num 3, pp 362-363, issn 0734-189XArticle

The computational complexity of maximization and integrationFRIEDMAN, H.Advances in mathematics (New York, NY. 1965). 1984, Vol 53, Num 1, pp 80-98, issn 0001-8708Article

Polynomial time computations in models of ETJOSEPH, D.Journal of computer and system sciences (Print). 1983, Vol 26, Num 3, pp 311-338, issn 0022-0000Article

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

Undecidability and intractability in theoretical physicsWOLFRAM, S.Physical review letters. 1985, Vol 54, Num 8, pp 735-738, issn 0031-9007Article

The NP-completeness column: an ongoing guideJOHNSON, D. S.Journal of algorithms (Print). 1984, Vol 5, Num 3, pp 433-447, issn 0196-6774Article

Bandwidth and pebblingROSENBERG, A. L; SUDBOROUGH, I. H.Computing (Wien. Print). 1983, Vol 31, Num 2, pp 115-139, issn 0010-485XArticle

On circuit-size complexity and the low hierarchy in NPKER-I KO; SCHONING, U.SIAM journal on computing (Print). 1985, Vol 14, Num 1, pp 41-51, issn 0097-5397Article

Simplicity, relativizations and nondeterminismBALCAZAR, J. L.SIAM journal on computing (Print). 1985, Vol 14, Num 1, pp 148-157, issn 0097-5397Article

Some results on addition/subtraction chainsVOLGER, H.Information processing letters. 1985, Vol 20, Num 3, pp 155-160, issn 0020-0190Article

On commutativity and approximationBINI, D.Theoretical computer science. 1984, Vol 28, Num 1-2, pp 135-150, issn 0304-3975Article

Experiments with some methods for the identification of finite-state systemsGERARDY, R.International journal of general systems (Print). 1983, Vol 9, Num 4, pp 197-203, issn 0308-1079Article

Collection from the left and other strategiesLEEDHAM-GREEN, C. R; SOICHER, L. H.Journal of symbolic computation. 1990, Vol 9, Num 5-6, pp 665-675, issn 0747-7171, 11 p.Article

A positive relativization of polynomial time versus polylog spaceGAVALDA, R.Information processing letters. 1993, Vol 46, Num 3, pp 119-123, issn 0020-0190Article

Approximation to measurable functions and its relation to probabilistic computationKO, K.-I.Annals of pure and applied logic. 1986, Vol 30, Num 2, pp 173-200, issn 0168-0072Article

Evaluating rational functions: infinite precision is finite cost and tractable on averageBLUM, L; SHUB, M.SIAM journal on computing (Print). 1986, Vol 15, Num 2, pp 384-398, issn 0097-5397Article

  • Page / 583