E-complete sets do not have optimal polynomial time approximations (Q5096868): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Bi-immune sets for complexity classes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Completeness, Approximation and Density / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal Approximations and Polynomially Levelable Sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3770515 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On one-one polynomial time equivalence relations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets / rank | |||
Normal rank |
Latest revision as of 21:45, 29 July 2024
scientific article; zbMATH DE number 7573173
Language | Label | Description | Also known as |
---|---|---|---|
English | E-complete sets do not have optimal polynomial time approximations |
scientific article; zbMATH DE number 7573173 |
Statements
E-complete sets do not have optimal polynomial time approximations (English)
0 references
18 August 2022
0 references