Modulo classes and logarithmic advice

DOI10.1016/0020-0190(95)00109-PMaRDI QIDQ672652zbMATH OpenFDO

Authors J. Ramachandran

Publication date 28 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Computational complexityAdviceCounting classes

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• The structure of logarithmic advice complexity classes
• Logarithmic advice classes
• Relations among MOD-classes
• A note on Mod and generalised Mod classes

Cites work

• scientific article; zbMATH DE number 192916 (Why is no real title available?)
• scientific article; zbMATH DE number 3799016 (Why is no real title available?)
• Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy
• Counting classes: Thresholds, parity, mods, and fewness
• Logarithmic advice classes
• On the construction of parallel computers from various basis of Boolean functions
• On the power of parity polynomial time
• PP is as Hard as the Polynomial-Time Hierarchy
• Relativized counting classes: Relations among thresholds, parity, and mods

Cited in

(1)

• Logarithmic advice classes

This page was built for publication: Modulo classes and logarithmic advice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672652)