Characterizing parallel hierarchies by reducibilities (Q1183416): Difference between revisions
From MaRDI portal
Changed an 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: Two Applications of Inductive Counting for Complementation Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A taxonomy of problems with fast parallel algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recursive Predicates and Quantifiers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On uniform circuit complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The polynomial-time hierarchy / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel computation and the NC hierarchy relativized / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Decomposability of $NC$ and $AC$ / rank | |||
Normal rank |
Revision as of 15:47, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Characterizing parallel hierarchies by reducibilities |
scientific article |
Statements
Characterizing parallel hierarchies by reducibilities (English)
0 references
28 June 1992
0 references
oracle circuits
0 references
parallel complexity classes
0 references
reducibility
0 references