NP-Hardness and ETH-Based Inapproximability of Communication Complexity via Relaxed Interlacing

From MaRDI portal
















This page was built for publication: NP-Hardness and ETH-Based Inapproximability of Communication Complexity via Relaxed Interlacing

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