新規登録 | ログイン | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

ima complexity [19 articles]

最近 ima さんのライブラリに追加された論文の中から タグ complexity. You can also see everyone's complexity.
  • Complexity and algorithms for nonlinear optimization problems
    Annals of Operations Research, Vol. 153, No. 1. (September 2007), pp. 257-296.
    by Hochbaum, Dorit
    posted to algorithm complexity nonlinear by ima on 2008-02-19 07:20:27 as **
  • Set theoretical Representations of Integers, I
    (2 Jan 2008)
    by Marie Ferbus-Zanda, Serge Grigorieff
    posted to complexity by ima on 2008-02-18 10:40:56 as **
  • Computers and Intractability : A Guide to the Theory of NP-Completeness
    (15 January 1979)
    by MR Garey, DS Johnson
    posted to complexity by ima on 2008-01-18 10:24:59 as ** along with 12 people gale82 creswick greenw danielaugot chechetka lcigler fdr eporreca Fin payton345 djlin tkollar
  • A layout adjustment problem for disjoint rectangles preserving orthogonal order
    Systems and Computers in Japan, Vol. 33, No. 2. (2002), pp. 31-42.
    by Kunihiko Hayashi, Michiko Inoue, Toshimitsu Masuzawa, Hideo Fujiwara
    posted to complexity drawing by ima on 2007-10-01 10:53:02 as **
  • On the Complexity of Processing Massive, Unordered, Distributed Data
    (21 Nov 2006)
    by Jon Feldman, S Muthukrishnan, Anastasios Sidiropoulos, Cliff Stein, Zoya Svitkina
    posted to complexity by ima on 2006-11-23 01:24:56 as ** along with 1 person gane5h
  • Equality of complexity classes P and NP: Linear programming formulation of the quadratic assignment problem
    (2 Sep 2006)
    by Moustapha Diaby
    posted to complexity by ima on 2006-09-05 05:00:52 as ** along with 1 person ansobol
  • P = NP: Linear programming formulation of the traveling salesman problem
    (2 Sep 2006)
    by Moustapha Diaby
    posted to complexity by ima on 2006-09-05 05:00:36 as ** along with 2 people ansobol proportional
  • The Tree Inclusion Problem: In Linear Space and Faster
    (31 Aug 2006)
    by Philip Bille, Inge L Goertz
    posted to complexity graph tree by ima on 2006-09-01 05:31:45 as ** along with 1 person ansobol
  • New connections between derandomization, worst-case complexity and average-case complexity
    Electronic Colloquium on Computational Complexity Report, Vol. TR06-108 (2006)
    by Dan Gutfreund, Amnon Ta-Shma
    posted to complexity by ima on 2006-08-29 06:35:19 as **
  • New approximability and inapproximability results for 2-dimensional Bin Packing
    SODA '04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms (2004), pp. 196-203.
    by Nikhil Bansal, Maxim Sviridenko
    posted to 2d approximate bin complexity packing by ima on 2006-08-22 09:56:10 as ** along with 1 person and 1 group cybrpunk dopsy
  • Packing 2-Dimensional Bins in Harmony
    (2002), pp. 490-499.
    by Alberto Caprara
    posted to 2d approximate bin complexity packing by ima on 2006-08-22 09:51:55 as **
  • Hardness of asymptotic approximation for orthogonal rectangle packing and covering problems
    Electronic Colloquium on Computational Complexity Report, Vol. TR06-019 (2006)
    by Janka Chlebíková, Miroslav Chlebík
    posted to 2d approximate complexity covering packing rectangle by ima on 2006-08-22 09:50:50 as **
  • An asymptotic approximation algorithm for 3D-strip packing
    SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm (2006), pp. 143-152.
    by Klaus Jansen, Roberto Solis-Oba
    posted to 3d approximate complexity packing strip by ima on 2006-08-22 09:39:58 as **
  • Approximation schemes for covering and packing problems in image processing and VLSI
    Journal of the ACM, Vol. 32, No. 1. (January 1985), pp. 130-136.
    by Dorit S Hochbaum, Wolfgang Maass
    posted to approximate circle complexity covering packing by ima on 2006-08-22 09:22:03 as **
  • Approximation of Geometric Dispersion Problems
    Algorithmica, Vol. 30, No. 3. (2001), pp. 451-470.
    by C Baur, SP Fekete
    posted to 2d approximate complexity packing by ima on 2006-08-22 09:11:24 as **
  • notes A polynomial-time approximation algorithm for a geometric dispersion problem
    Lecture Notes in Computer Science, Vol. 4112 (2006), pp. 166-175.
    by Joachim Gudmundsson, Marc Benkert, Rene van Oostrum, Christian Knauer, Alexander Wolff, Esther Moet
    posted to 2d algorithm approximate circle complexity packing by ima on 2006-08-20 06:18:43 as **
  • Inapproximability of the Tutte polynomial
    (30 May 2006)
    by Leslie A Goldberg, Mark Jerrum
    posted to complexity by ima on 2006-07-06 15:10:54 as **
  • Protein Design is NP-hard
    Protein Eng., Vol. 15, No. 10. (1 October 2002), pp. 779-782.
    by Niles A Pierce, Erik Winfree
    posted to complexity protein by ima on 2006-05-01 07:47:49 as ** along with 6 people ansobol gane5h bluvsh1 kray mijam iantunbridge
  • The quantum measurement problem and physical reality: a computation theoretic perspective
    (14 Feb 2006)
    by R Srikanth
    posted to complexity quantum by ima on 2006-02-21 09:12:34 as ** along with 2 people ansobol jrw
    • 注: このページを引用する時は次のURLでどうぞ: http://www.citeulike.org/user/ima/tag/complexity

    RIS BibTeX
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.