Matches in SemOpenAlex for { <https://semopenalex.org/work/W177685096> ?p ?o ?g. }
Showing items 1 to 75 of
75
with 100 items per page.
- W177685096 abstract "This thesis studies average-case complexity theory and polynomial-time reducibilities. Levin initiated a general study of average-case complexity by defining a robust notion of average polynomial time and the notion of distributional NP-completeness. Cai and Selman gave a general definition of T on average for arbitrary time bounds T. Their definition of average polynomial time slightly modifies Levin's definition to avoid some of the difficulties of Levin's definition. In this thesis we study reasonable distributions, distributionally-hard languages, and reductions among distributional problems. We prove several results demonstrating that it suffices to restrict one's attention to reasonable distributions. We show that if NP has a DTIME(2 n)-bi-immune language, then every DistNP-complete problem must have a reasonable distribution. We prove that the class, Ppcomp , a class defined by Schuler and Yamakami, remains unchanged when restricted to reasonable distributions. We strengthen and present a simpler proof of a result of Belanger and Wang, which shows that Cai and Selman's definition of average-polynomial time is not closed under many-one reductions. Cai and Selman showed that every is P-bi-immune language is distributionally-hard. We study the question of whether there exist distributionally-hard languages that are not P-bi-immune. First we show that such languages exist if and only if P contains P-printable-immune sets. Then we extend this characterization significantly to include assertions about several traditional questions about immunity, about finding witnesses for NP-machines, and about the existence of one-way functions. Next we study polynomial-time reducibilities. Ladner, Lynch, and Selman showed, in the context of worst-case complexity, that various polynomial-time reductions differ in E. We show similar results for reductions between distributional problems and we show that most of the completeness notions for DistEXP are different. Finally, we turn our attention to the question of whether various notions of NP-completeness are different. Lutz and Mayordomo and Ambos-Spies and Bentzien, under hypotheses about the stochastic properties of NP, showed that various completeness notions in NP are different. We introduce a structural hypothesis not involving stochastic properties and prove that the existence of a Turing complete language for NP that is not truth-table complete follows from our hypothesis." @default.
- W177685096 created "2016-06-24" @default.
- W177685096 creator A5051370311 @default.
- W177685096 creator A5053019121 @default.
- W177685096 date "2001-01-01" @default.
- W177685096 modified "2023-09-26" @default.
- W177685096 title "Average-case complexity theory and polynomial-time reductions" @default.
- W177685096 hasPublicationYear "2001" @default.
- W177685096 type Work @default.
- W177685096 sameAs 177685096 @default.
- W177685096 citedByCount "0" @default.
- W177685096 crossrefType "journal-article" @default.
- W177685096 hasAuthorship W177685096A5051370311 @default.
- W177685096 hasAuthorship W177685096A5053019121 @default.
- W177685096 hasConcept C11413529 @default.
- W177685096 hasConcept C114614502 @default.
- W177685096 hasConcept C118615104 @default.
- W177685096 hasConcept C131671149 @default.
- W177685096 hasConcept C134306372 @default.
- W177685096 hasConcept C154945302 @default.
- W177685096 hasConcept C15547884 @default.
- W177685096 hasConcept C17231256 @default.
- W177685096 hasConcept C186861659 @default.
- W177685096 hasConcept C2777212361 @default.
- W177685096 hasConcept C29248071 @default.
- W177685096 hasConcept C311688 @default.
- W177685096 hasConcept C33923547 @default.
- W177685096 hasConcept C39637292 @default.
- W177685096 hasConcept C41008148 @default.
- W177685096 hasConcept C45374587 @default.
- W177685096 hasConcept C90119067 @default.
- W177685096 hasConceptScore W177685096C11413529 @default.
- W177685096 hasConceptScore W177685096C114614502 @default.
- W177685096 hasConceptScore W177685096C118615104 @default.
- W177685096 hasConceptScore W177685096C131671149 @default.
- W177685096 hasConceptScore W177685096C134306372 @default.
- W177685096 hasConceptScore W177685096C154945302 @default.
- W177685096 hasConceptScore W177685096C15547884 @default.
- W177685096 hasConceptScore W177685096C17231256 @default.
- W177685096 hasConceptScore W177685096C186861659 @default.
- W177685096 hasConceptScore W177685096C2777212361 @default.
- W177685096 hasConceptScore W177685096C29248071 @default.
- W177685096 hasConceptScore W177685096C311688 @default.
- W177685096 hasConceptScore W177685096C33923547 @default.
- W177685096 hasConceptScore W177685096C39637292 @default.
- W177685096 hasConceptScore W177685096C41008148 @default.
- W177685096 hasConceptScore W177685096C45374587 @default.
- W177685096 hasConceptScore W177685096C90119067 @default.
- W177685096 hasLocation W1776850961 @default.
- W177685096 hasOpenAccess W177685096 @default.
- W177685096 hasPrimaryLocation W1776850961 @default.
- W177685096 hasRelatedWork W1556231926 @default.
- W177685096 hasRelatedWork W1600428721 @default.
- W177685096 hasRelatedWork W1963695130 @default.
- W177685096 hasRelatedWork W1964410812 @default.
- W177685096 hasRelatedWork W1967415230 @default.
- W177685096 hasRelatedWork W1978337116 @default.
- W177685096 hasRelatedWork W2030312085 @default.
- W177685096 hasRelatedWork W2064577184 @default.
- W177685096 hasRelatedWork W2074831123 @default.
- W177685096 hasRelatedWork W2098066196 @default.
- W177685096 hasRelatedWork W2156369551 @default.
- W177685096 hasRelatedWork W2177204320 @default.
- W177685096 hasRelatedWork W2278335590 @default.
- W177685096 hasRelatedWork W2402235836 @default.
- W177685096 hasRelatedWork W2461225692 @default.
- W177685096 hasRelatedWork W2467993439 @default.
- W177685096 hasRelatedWork W2510208335 @default.
- W177685096 hasRelatedWork W2950617606 @default.
- W177685096 hasRelatedWork W3127722798 @default.
- W177685096 hasRelatedWork W3196775331 @default.
- W177685096 isParatext "false" @default.
- W177685096 isRetracted "false" @default.
- W177685096 magId "177685096" @default.
- W177685096 workType "article" @default.