External Links

    Journal: Computational Complexity

    Volume 21, Issue 3

    359 -- 419Markus Bläser, Holger Dell, Mahmoud Fouz. Complexity and Approximability of the Cover Polynomial
    421 -- 429Jacek Pomykala, Bartosz Zralek. On reducing factorization to the discrete logarithm problem modulo a composite
    431 -- 477Henning Wunderlich. On a Theorem of Razborov
    479 -- 497Luis Filipe Coelho Antunes, Lance Fortnow, Alexandre Pinto, Andre Souto. Low-Depth Witnesses are Easy to Find
    499 -- 510Hugue Blier, Alain Tapp. A Quantum Characterization Of NP
    511 -- 513Hannah Alpert, Jennifer Iglesias. Length 3 Edge-Disjoint Paths Is NP-Hard
    runs on