Separations between combinatorial measures for transitive functions

DOI10.4230/LIPICS.ICALP.2022.36MaRDI QIDQ6560823zbMATH OpenFDO

Authors Sourav Chakraborty, Chandrima Kayal, Manaswi Paraashar

Publication date 24 June 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2022.36

zbMATH Keywords

combinatorial complexity of Boolean functionstransitive functions

Mathematics Subject Classification ID

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

Cited in

(3)

• On query complexity measures and their relations for symmetric functions
• Symmetries, graph properties, and quantum speedups
• Separations between combinatorial measures for transitive functions

This page was built for publication: Separations between combinatorial measures for transitive functions

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