Home

A. Pavan

  1. Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses.

    Tue, 01/05/2010 - 16:01 — SomNambul
    Authors: Xiaoyang Gu, John M. Hitchcock, A. Pavan
    Subjects: Computational Complexity
    Abstract

    This paper presents the following results on sets that are complete for NP.

Math-arch

Syndicate content