Exponential lower bounds for monotone span programs

DOI10.1109/FOCS.2016.51MaRDI QIDQ6946457zbMATH OpenFDO

Authors Benjamin Rossman, Stephen Cook, Toniann Pitassi, Robert Robere

Publication date 6 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2016.51

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(5)

• On protocols for monotone feasible interpolation
• Strength and limitations of Sherali-Adams and nullstellensatz proof systems
• Simplified PIR and CDS protocols and improved linear secret-sharing schemes
• Randomized lifting to semi-structured communication complexity via linear diversity
• Searching for falsified clause in random ( n)-CNFs is hard for randomized communication

This page was built for publication: Exponential lower bounds for monotone span programs

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