Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Submitted to the Symposium on Theoretical Aspects of Computer Science www.stacs-conf.org
 

Summary: Submitted to the Symposium on Theoretical Aspects of Computer Science
www.stacs-conf.org
COLLAPSING AND SEPARATING COMPLETENESS NOTIONS UNDER
AVERAGE-CASE AND WORST-CASE HYPOTHESES
XIAOYANG GU 1
AND JOHN M. HITCHCOCK 2
AND A. PAVAN 3
1
LinkedIn Corporation
2
Department of Computer Science, University of Wyoming
3
Department of Computer Science, Iowa State University
Abstract. This paper presents the following results on sets that are complete for NP.
(i) If there is a problem in NP that requires 2n(1)
time at almost all lengths, then every many-
one NP-complete set is complete under length-increasing reductions that are computed by
polynomial-size circuits.
(ii) If there is a problem in co-NP that cannot be solved by polynomial-size nondeterministic
circuits, then every many-one complete set is complete under length-increasing reductions

  

Source: Aduri, Pavan - Department of Computer Science, Iowa State University
Hitchcock, John - Department of Computer Science, University of Wyoming

 

Collections: Computer Technologies and Information Sciences