Classification of the index sets of low \([n]^ p\) and high \([n]^ p\) (Q1337641): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Alternation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A hierarchy for nondeterministic time complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The NP-completeness column: An ongoing guide / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computational complexity, speedable and levelable sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3819052 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4134973 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3707407 / rank | |||
Normal rank |
Revision as of 10:20, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Classification of the index sets of low \([n]^ p\) and high \([n]^ p\) |
scientific article |
Statements
Classification of the index sets of low \([n]^ p\) and high \([n]^ p\) (English)
0 references
19 September 1995
0 references
polynomial enumerable sets
0 references
index sets
0 references