NP-hardness

Results: 35



#Item
11Distributed Verification and Hardness of Distributed ∗ Approximation Atish Das Sarma †

Distributed Verification and Hardness of Distributed ∗ Approximation Atish Das Sarma †

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2015-05-18 12:16:16
12COMPLEXITY OF SIMPLICIAL HOMOLOGY AND INDEPENDENCE COMPLEXES OF CHORDAL GRAPHS MICHAL ADAMASZEK AND JURAJ STACHO Abstract. We prove the NP-hardness of computing homology groups of simplicial complexes when the size of th

COMPLEXITY OF SIMPLICIAL HOMOLOGY AND INDEPENDENCE COMPLEXES OF CHORDAL GRAPHS MICHAL ADAMASZEK AND JURAJ STACHO Abstract. We prove the NP-hardness of computing homology groups of simplicial complexes when the size of th

Add to Reading List

Source URL: www.mimuw.edu.pl

Language: English - Date: 2016-04-27 19:20:09
    13NP-hardness of the minimum point and edge 2-transmitter cover problem Sarah Cannon∗ Thomas G. Fai† Justin Iwerks‡

    NP-hardness of the minimum point and edge 2-transmitter cover problem Sarah Cannon∗ Thomas G. Fai† Justin Iwerks‡

    Add to Reading List

    Source URL: fwcg14.cse.uconn.edu

    Language: English - Date: 2014-10-29 21:34:30
      14NP-Hardness Results for Protein Side-chain Packing Tatsuya Akutsu Human Genome Center, Institute of Medical Science, University of TokyoShirokanedai, Minato-ku, Tokyo 108, Japan

      NP-Hardness Results for Protein Side-chain Packing Tatsuya Akutsu Human Genome Center, Institute of Medical Science, University of TokyoShirokanedai, Minato-ku, Tokyo 108, Japan

      Add to Reading List

      Source URL: www.jsbi.org

      Language: English - Date: 1998-03-31 03:49:18
        15COMPLEXITY OF SIMPLICIAL HOMOLOGY AND INDEPENDENCE COMPLEXES OF CHORDAL GRAPHS MICHAL ADAMASZEK AND JURAJ STACHO Abstract. We prove the NP-hardness of computing homology groups of simplicial complexes when the size of th

        COMPLEXITY OF SIMPLICIAL HOMOLOGY AND INDEPENDENCE COMPLEXES OF CHORDAL GRAPHS MICHAL ADAMASZEK AND JURAJ STACHO Abstract. We prove the NP-hardness of computing homology groups of simplicial complexes when the size of th

        Add to Reading List

        Source URL: www.mimuw.edu.pl

        Language: English - Date: 2016-02-08 09:21:53
          16NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs Sepp Hartung and Andr´e Nichterlein Institut f¨ ur Softwaretechnik und Theoretische Informatik,

          NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs Sepp Hartung and Andr´e Nichterlein Institut f¨ ur Softwaretechnik und Theoretische Informatik,

          Add to Reading List

          Source URL: fpt.akt.tu-berlin.de

          Language: English - Date: 2012-04-11 04:30:08
            17A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP Iftach Haitner Mohammad Mahmoody

            A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP Iftach Haitner Mohammad Mahmoody

            Add to Reading List

            Source URL: www.cs.tau.ac.il

            Language: English - Date: 2013-06-11 04:13:24
              18On Hardness of Pricing Items for Single-Minded Bidders∗ Rohit Khandekar Tracy Kimbrel Konstantin Makarychev

              On Hardness of Pricing Items for Single-Minded Bidders∗ Rohit Khandekar Tracy Kimbrel Konstantin Makarychev

              Add to Reading List

              Source URL: konstantin.makarychev.net

              Language: English - Date: 2014-06-08 22:16:35
              19CCCG 2011, Toronto ON, August 10–12, 2011 Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning David Kirkpatrick∗

              CCCG 2011, Toronto ON, August 10–12, 2011 Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning David Kirkpatrick∗

              Add to Reading List

              Source URL: www.cccg.ca

              Language: English - Date: 2011-08-06 04:11:16
              20CCCG 2011, Toronto ON, August 10–12, 2011 Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning David Kirkpatrick∗

              CCCG 2011, Toronto ON, August 10–12, 2011 Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning David Kirkpatrick∗

              Add to Reading List

              Source URL: 2011.cccg.ca

              Language: English - Date: 2011-08-06 04:11:16