Linear Systems over Composite Moduli

DOI10.1109/FOCS.2009.17zbMath1292.68072OpenAlexW2152439289MaRDI QIDQ5171161

Avi Wigderson, Arkadev Chattopadhyay

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

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

Related Items (5)

Correlation lower bounds from correlation upper bounds ⋮ Nonuniform ACC Circuit Lower Bounds ⋮ Depth Reduction for Composites ⋮ Unnamed Item ⋮ Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations

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