scientific article; zbMATH DE number 7561557

DOI10.4230/LIPIcs.ICALP.2019.64MaRDI QIDQ5091221

Swagato Sanyal, Troy Lee, Miklos Santha, Dmitry Gavinsky

Publication date: 21 July 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

lower boundsquery complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (2)

Unnamed Item ⋮ Conflict complexity is lower bounded by block sensitivity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Composition limits and separating examples for some Boolean function complexity measures
• Quantum certificate complexity
• How to Compress Interactive Communication
• Properties and applications of boolean function composition

This page was built for publication: