Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem

zbMath1044.68072arXivcs/0110031MaRDI QIDQ4472443

Pranab Sen, Sundar Vishwanathan, Jaikumar Radhakrishnan

Publication date: 4 August 2004

Full work available at URL: https://arxiv.org/abs/cs/0110031

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Affine projections of symmetric polynomials. ⋮ Regarding two conjectures on clique and biclique partitions ⋮ Decomposing the complete \(r\)-graph ⋮ Odd covers of graphs ⋮ Addressing graph products and distance-regular graphs ⋮ Multicovering hypergraphs ⋮ On decompositions of complete hypergraphs

This page was built for publication: Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem