Genericity and measure for exponential time
type: Item
instance of: scholarly article
title: Genericity and measure for exponential time
zbMATH Open document ID: 0874.68094
DOI: 10.1016/0304-3975(96)89424-2
author: Hans-Christian Neis
author: Sebastiaan A. Terwijn
author: Klaus Ambos-Spies
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
full work available at URL: genericity-and-measure-for-exponential-time(4ffcfdc4-5355-4e0e-91e4-7983d0a34138).html
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 984225
MaRDI profile type: Publication
OpenAlex ID: W2070150049
cites work: Q4723714
cites work: Diagonalizations over polynomial time computable sets
cites work: Q4734760
cites work: Q4525724
cites work: Bi-immune sets for complexity classes
cites work: Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
cites work: Q3751568
cites work: On relativized exponential and probabilistic complexity classes
cites work: Q3905267
cites work: The Complexity and Distribution of Hard Problems
cites work: A comparison of polynomial time reducibilities
cites work: Category and Measure in Complexity Classes
cites work: Almost everywhere high nonuniform complexity
cites work: Measure, Stochasticity, and the Density of Hard Languages
cites work: Cook versus Karp-Levin: Separating completeness notions if NP is not small
cites work: The definition of random sequences
cites work: Almost every set in exponential time is P-bi-immune
cites work: Q5616138
cites work: Polynomial-time reducibilities and ``almost all'' oracle sets
description: scientific article; zbMATH DE number 984225