On gamma-reducibility versus polynomial time many-one reducibility (Q1149766): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(81)90007-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1974647909 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of theorem-proving procedures / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4142699 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A comparison of polynomial time reducibilities / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Relative complexity of checking and evaluating / rank | |||
Normal rank | |||
Latest revision as of 11:37, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On gamma-reducibility versus polynomial time many-one reducibility |
scientific article |
Statements
On gamma-reducibility versus polynomial time many-one reducibility (English)
0 references
1981
0 references
equivalence of complexity classes
0 references
gamma-reducibility
0 references
