Modulo classes and logarithmic advice

DOI10.1016/0020-0190(95)00109-PzbMath0875.68424MaRDI QIDQ672652

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)

Cites Work

• Unnamed Item
• Unnamed Item
• On the construction of parallel computers from various basis of Boolean functions
• Logarithmic advice classes
• Relativized counting classes: Relations among thresholds, parity, and mods
• PP is as Hard as the Polynomial-Time Hierarchy
• Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy
• On the power of parity polynomial time
• Counting classes: Thresholds, parity, mods, and fewness

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