Linear Systems over Composite Moduli

DOI10.1109/FOCS.2009.17MaRDI QIDQ5171161zbMATH OpenOpenAlexFDO

Authors Arkadev Chattopadhyay, A. Wigderson

Publication date 25 July 2014

Published in 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/focs.2009.17

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited in

(5)

• Correlation lower bounds from correlation upper bounds
• Nonuniform ACC circuit lower bounds
• Depth reduction for composites
• scientific article; zbMATH DE number 7250145 (Why is no real title available?)
• Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations

This page was built for publication: Linear Systems over Composite Moduli

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