Регистрация | Вход в службу | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

johannsen sat [4 articles]

Recent papers added to johannsen library classified by the tag sat. You can also see everyone's sat.
  • Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT
    Theoretical Computer Science, Vol. 329, No. 1-3. (13 December 2004), pp. 1-45.
    by Amin Coja-Oghlan, Andreas Goerdt, Andre Lanka, Frank Schadlich
    posted to sat by johannsen on 2005-03-24 15:09:12 as **
  • An Improved Upper Bound for SAT
    by Evgeny Dantsin, Alexander Wolpert
    posted to sat by johannsen on 2005-03-17 09:28:32 as **
  • An improved deterministic local search algorithm for 3-SAT
    Theoretical Computer Science, Vol. 329, No. 1-3. (13 December 2004), pp. 303-313.
    by Tobias Brueggemann, Walter Kern
    posted to sat by johannsen on 2005-03-17 08:57:44 as ***
  • Computing unsatisfiable k-SAT instances with few occurrences per variable
    Theoretical Computer Science, Vol. In Press, Uncorrected Proof
    by Shlomo Hoory, Stefan Szeider
    posted to sat by johannsen on 2005-03-17 08:52:30 as ***
    • Вы можете ссылаться на эту страницу по адресу: http://www.citeulike.org/user/johannsen/tag/sat

    RIS BibTeX RSS
    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.