Modulo classes and logarithmic advice (Q672652): 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: Q4039803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmic advice classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativized counting classes: Relations among thresholds, parity, and mods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting classes: Thresholds, parity, mods, and fewness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of parity polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of parallel computers from various basis of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4743737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PP is as Hard as the Polynomial-Time Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy / rank
 
Normal rank

Latest revision as of 11:19, 27 May 2024

scientific article
Language Label Description Also known as
English
Modulo classes and logarithmic advice
scientific article

    Statements