A complexity theory for hard enumeration problems (Q2274092)
From MaRDI portal
(Redirected from Item:Q5738996)
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A complexity theory for hard enumeration problems |
scientific article; zbMATH DE number 6725136
- On the Complexity of Hard Enumeration Problems
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A complexity theory for hard enumeration problems |
scientific article; zbMATH DE number 6725136 |
|
Statements
A complexity theory for hard enumeration problems (English)
0 references
On the Complexity of Hard Enumeration Problems (English)
0 references
19 September 2019
0 references
1 June 2017
0 references
computational complexity
0 references
enumeration
0 references
complexity classes
0 references
reductions
0 references
0 references
0 references
0.9904029369354248
0 references
0.7868055105209351
0 references
0.7866768836975098
0 references