Comparing nontriviality for E and EXP
type: Item
instance of: scholarly article
title: Comparing nontriviality for E and EXP
zbMATH Open document ID: 1253.68137
author: Timur Bakibayev
author: Klaus Ambos-Spies
published in: Theory of Computing Systems
publication date: 2012-12-07T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6113694
zbMATH Keywords: completeness
zbMATH Keywords: weak completeness
zbMATH Keywords: exponential time
zbMATH Keywords: polynomial-time reducibilities
zbMATH Keywords: linear-exponential-time class
zbMATH Keywords: polynomial-exponential-time class
MaRDI profile type: Publication
full work available at URL: s00224-011-9370-3
OpenAlex ID: W1983486272
cites work: Q4863237
cites work: Weak Completeness Notions for Exponential Time
cites work: Quantitative aspects of speed-up and gap phenomena
cites work: Q4348122
cites work: Resource bounded randomness and weakly complete problems
cites work: Q4039803
cites work: Q3996675
cites work: Weak completeness in \(\text{E}\) and \(\text{E}_{2}\)
cites work: Almost everywhere high nonuniform complexity
cites work: Weakly Hard Problems
cites work: Q4359463
cites work: Measure, Stochasticity, and the Density of Hard Languages
DOI: 10.1007/S00224-011-9370-3
description: scientific article; zbMATH DE number 6113694