NP-completeness

Results: 54



#Item
1Informatique Fondamentale IMA S8 Cours 4 : graphs, problems and algorithms on graphs, (notions of) NP completeness Laure Gonnord http://laure.gonnord.org/pro/teaching/

Informatique Fondamentale IMA S8 Cours 4 : graphs, problems and algorithms on graphs, (notions of) NP completeness Laure Gonnord http://laure.gonnord.org/pro/teaching/

Add to Reading List

Source URL: laure.gonnord.org

Language: English
    2The Subset Sum Problem Reducing Time Complexity of NP-Completeness with Quantum Search Abstract The Subset Sum Problem is a member of the NPcomplete class, so no known polynomial time algorithm exists for it. Although th

    The Subset Sum Problem Reducing Time Complexity of NP-Completeness with Quantum Search Abstract The Subset Sum Problem is a member of the NPcomplete class, so no known polynomial time algorithm exists for it. Although th

    Add to Reading List

    Source URL: ciim.usf.edu

    - Date: 1980-01-01 00:00:00
      3CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time

      CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time

      Add to Reading List

      Source URL: theory.stanford.edu

      Language: English - Date: 2014-01-06 16:13:01
      4Part I: Introduction Part II: Solution The complexity of Sur-Hom(C∗4 ) Barnaby Martin and Dan¨ıel Paulusma

      Part I: Introduction Part II: Solution The complexity of Sur-Hom(C∗4 ) Barnaby Martin and Dan¨ıel Paulusma

      Add to Reading List

      Source URL: www.bedewell.com

      Language: English - Date: 2011-09-12 12:52:00
      5A PTAS for the Highway Problem Fabrizio Grandoni & Thomas Rothvo Institute of Mathemati s EPFL, Lausanne The Highway Problem

      A PTAS for the Highway Problem Fabrizio Grandoni & Thomas Rothvo Institute of Mathemati s EPFL, Lausanne The Highway Problem

      Add to Reading List

      Source URL: www.math.washington.edu

      Language: English - Date: 2013-11-01 17:11:36
      6Bin Pa king via Dis repan y of Permutations F. Eisenbrand, D. Palv olgyi & T. Rothvo Cargese Workshop 2010

      Bin Pa king via Dis repan y of Permutations F. Eisenbrand, D. Palv olgyi & T. Rothvo Cargese Workshop 2010

      Add to Reading List

      Source URL: www.math.washington.edu

      Language: English - Date: 2013-11-01 17:11:36
      7CS681: Advanced Topics in Computational Biology Week 7 Lectures 2-3 Can Alkan EA224

      CS681: Advanced Topics in Computational Biology Week 7 Lectures 2-3 Can Alkan EA224

      Add to Reading List

      Source URL: www.cs.bilkent.edu.tr

      Language: English - Date: 2012-03-26 04:52:47
      8SAT Instances for Termination Analysis with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

      SAT Instances for Termination Analysis with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

      Add to Reading List

      Source URL: www.dcs.bbk.ac.uk

      Language: English - Date: 2009-06-09 05:12:21
      9Aachen Department of Computer Science Technical Report SAT Encodings: From Constraint-Based Termination

      Aachen Department of Computer Science Technical Report SAT Encodings: From Constraint-Based Termination

      Add to Reading List

      Source URL: sunsite.informatik.rwth-aachen.de

      Language: English - Date: 2012-10-02 11:28:08
      10Safety to the Weak! Security Through Feebleness: An Unorthodox Manifesto Rick McGeer, US Ignite Outline

      Safety to the Weak! Security Through Feebleness: An Unorthodox Manifesto Rick McGeer, US Ignite Outline

      Add to Reading List

      Source URL: spw16.langsec.org

      Language: English - Date: 2016-06-05 23:40:05