Get Math Help

GET TUTORING NEAR ME!

(800) 434-2582

By submitting the following form, you agree to Club Z!'s Terms of Use and Privacy Policy

    Home / Get Math Help

    Q-polynomial

    Description

    QP algorithms are slower than polynomial time but faster than exponential time.

    Equivalent definitions

    \!\(\*FormBox[ RowBox[{

    Time constraint

    \!\(\*FormBox[ RowBox[{ RowBox[{

    Best supersets

    QP ⊆ BPQP | QP ⊆ SUBEXP

    Best subsets

    QP ⊇ β_P | QP ⊇ polyL | QP ⊇ QPLIN

    Class inclusions diagram

    (supersets shown above subsets)

    Back to List | POWERED BY THE WOLFRAM LANGUAGE