Which problems have strongly exponential complexity?

Russell Impagliazzo and Ramamohan Paturi and Francis Zane

misc2001

Citation key: ImpagliazzoPaturiZane2001
Year: 2001
Cited by: 2 catalog records
Direct source: Available

Reference note

Why this source is in the ledger

Russell Impagliazzo, Ramamohan Paturi, and Francis Zane, “Which problems have strongly exponential complexity?” Journal of Computer and System Sciences 63 (2001), 512–530, DOI: 10.1006/jcss.2001.1774.

Catalog connections

Conjectures citing this source

Source record

Bibliographic fields

Inspect the parsed BibTeX fields

author: Russell Impagliazzo and Ramamohan Paturi and Francis Zane
doi: 10.1006/jcss.2001.1774
note: Russell Impagliazzo, Ramamohan Paturi, and Francis Zane, “Which problems have strongly exponential complexity?” Journal of Computer and System Sciences 63 (2001), 512--530, DOI: 10.1006/jcss.2001.1774.
title: Which problems have strongly exponential complexity?
year: 2001