Polynomial hierarchy

Results: 38



#Item
1ON THE LASSERRE HIERARCHY OF SEMIDEFINITE PROGRAMMING RELAXATIONS OF CONVEX POLYNOMIAL OPTIMIZATION PROBLEMS ETIENNE DE KLERK∗ AND MONIQUE LAURENT† Abstract. The Lasserre hierarchy of semidefinite programming approxi

ON THE LASSERRE HIERARCHY OF SEMIDEFINITE PROGRAMMING RELAXATIONS OF CONVEX POLYNOMIAL OPTIMIZATION PROBLEMS ETIENNE DE KLERK∗ AND MONIQUE LAURENT† Abstract. The Lasserre hierarchy of semidefinite programming approxi

Add to Reading List

Source URL: homepages.cwi.nl

Language: English - Date: 2011-06-06 01:41:37
    2Delineating the polynomial hierarchy in a fragment of intuitionistic logic via over -focussing Anupam Das ´ Ecole Normale Sup´erieure de Lyon, France

    Delineating the polynomial hierarchy in a fragment of intuitionistic logic via over -focussing Anupam Das ´ Ecole Normale Sup´erieure de Lyon, France

    Add to Reading List

    Source URL: anupamdas.com

    - Date: 2017-08-04 11:45:45
      3ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND LANCE FORTNOWz

      ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND LANCE FORTNOWz

      Add to Reading List

      Source URL: cs-www.cs.yale.edu

      Language: English - Date: 2001-10-25 12:45:35
      4ON THE LASSERRE HIERARCHY OF SEMIDEFINITE PROGRAMMING RELAXATIONS OF CONVEX POLYNOMIAL OPTIMIZATION PROBLEMS ETIENNE DE KLERK∗ AND MONIQUE LAURENT† Abstract. The Lasserre hierarchy of semidefinite programming approxi

      ON THE LASSERRE HIERARCHY OF SEMIDEFINITE PROGRAMMING RELAXATIONS OF CONVEX POLYNOMIAL OPTIMIZATION PROBLEMS ETIENNE DE KLERK∗ AND MONIQUE LAURENT† Abstract. The Lasserre hierarchy of semidefinite programming approxi

      Add to Reading List

      Source URL: homepages.cwi.nl

      Language: English - Date: 2011-06-06 01:41:37
        5BQP and the Polynomial Hierarchy Scott Aaronson∗ Abstract The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve

        BQP and the Polynomial Hierarchy Scott Aaronson∗ Abstract The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve

        Add to Reading List

        Source URL: www.scottaaronson.com

        Language: English - Date: 2010-02-16 00:41:32
          6First steps towards linking membrane depth and the Polynomial Hierarchy Antonio E. Porreca2 and Niall Murphy1 1 Department of Computer Science, National University of Ireland Maynooth,

          First steps towards linking membrane depth and the Polynomial Hierarchy Antonio E. Porreca2 and Niall Murphy1 1 Department of Computer Science, National University of Ireland Maynooth,

          Add to Reading List

          Source URL: www.niallmurphy.me

          Language: English - Date: 2014-04-02 12:28:15
            7On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy

            On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy

            Add to Reading List

            Source URL: www.theoryofcomputing.org

            Language: English - Date: 2014-11-14 13:01:53
              8February 3, 2009 COM S 6810 Theory of Computing Lecture 5: Polynomial Hierarchy Instructor: Rafael Pass

              February 3, 2009 COM S 6810 Theory of Computing Lecture 5: Polynomial Hierarchy Instructor: Rafael Pass

              Add to Reading List

              Source URL: www.cs.cornell.edu

              Language: English - Date: 2009-02-04 17:20:26
              9CONSISTENCY PROOF OF A FEASIBLE ARITHMETIC INSIDE A BOUNDED ARITHMETIC YORIYUKI YAMAGATA Ever since Buss showed the relation of his hierarchy of bounded arithmetic S2i , i = 1, 2, . . . to polynomial-time hierarchy of co

              CONSISTENCY PROOF OF A FEASIBLE ARITHMETIC INSIDE A BOUNDED ARITHMETIC YORIYUKI YAMAGATA Ever since Buss showed the relation of his hierarchy of bounded arithmetic S2i , i = 1, 2, . . . to polynomial-time hierarchy of co

              Add to Reading List

              Source URL: www.cs.swansea.ac.uk

              Language: English - Date: 2015-06-30 19:27:17
                10Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses Holger Dell∗ Dieter van Melkebeek†

                Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses Holger Dell∗ Dieter van Melkebeek†

                Add to Reading List

                Source URL: www.holgerdell.com

                Language: English