Modulo classes and logarithmic advice

DOI10.1016/0020-0190(95)00109-PzbMATH Open0875.68424MaRDI QIDQ672652FDOQ672652

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

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

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)