Erakusten 8.191 - 8.200 emaitzak -- 8.437 bilaketa honetara '"Problems."', Bilaketaren denbora: 0,05s Findu emaitzak
  1. 8191

    Hypercube permutations routable under all dimension orderings. nork Panaite, Petrisor

    Argitaratua izan da Information processing letters.
    Artikulua

    Hypercube permutations routable under all dimension orderings.
  2. 8192

    The element distinctness problem on one-tape Turing machines. nork Szepietowski, Andrzej

    Argitaratua izan da Information processing letters.
    Artikulua

    The element distinctness problem on one-tape Turing machines.
  3. 8193

    A note on approximation of the vertex cover and feedback vertex set problems-Unified approach. nork Fujito, Toshihiro

    Argitaratua izan da Information processing letters.
    Artikulua

    A note on approximation of the vertex cover and feedback vertex set problems-Unified approach.
  4. 8194

    Indexing compressed text. nork Ferragina, Paolo

    Argitaratua izan da Journal of the ACM
    Artikulua

    Indexing compressed text.
  5. 8195

    Source routing and scheduling in packet networks. nork Andrews, Matthew

    Argitaratua izan da Journal of the ACM
    Artikulua

    Source routing and scheduling in packet networks.
  6. 8196

    Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. nork Kaplan, Haim

    Argitaratua izan da Journal of the ACM
    Artikulua

    Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs.
  7. 8197

    Concurrent zero-knowledge. nork Dwork, Cynthia

    Argitaratua izan da Journal of the ACM
    Artikulua

    Concurrent zero-knowledge.
  8. 8198

    Fast monte-carlo algorithms for finding low-rank approximations. nork Frieze, Alan

    Argitaratua izan da Journal of the ACM
    Artikulua

    Fast monte-carlo algorithms for finding low-rank approximations.
  9. 8199

    Almost tight upper bounds for vertical decompositions in four dimensions. nork Koltun, Vladlen

    Argitaratua izan da Journal of the ACM
    Artikulua

    Almost tight upper bounds for vertical decompositions in four dimensions.
  10. 8200

    Resolution lower bounds for the weak pigeonhole principle. nork Raz, R.

    Argitaratua izan da Journal of the ACM
    Artikulua

    Resolution lower bounds for the weak pigeonhole principle.

Bilaketa egiteko lanabesak: