Modified ranks of tensors and the size of circuits

DOI10.1145/167088.167228zbMath1310.68119OpenAlexW2054818820MaRDI QIDQ5248522

Pavel Pudlák, Vojtěch Rödl

Publication date: 7 May 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/167088.167228

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Some combinatorial-algebraic problems from complexity theory ⋮ Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time ⋮ Algebraic techniques in communication complexity ⋮ Upper bound on the communication complexity of private information retrieval ⋮ Optimal single-server private information retrieval ⋮ Matrix rank and communication complexity ⋮ Private information retrieval with sublinear online time

This page was built for publication: Modified ranks of tensors and the size of circuits