scientific article; zbMATH DE number 6789270

DOI10.4230/LIPICS.CCC.2016.5MaRDI QIDQ5368739zbMATH OpenFDO

Authors Mika Göös, T. S. Jayram

Publication date 10 October 2017

Full work available at URL https://doi.org/10.4230/LIPICS.CCC.2016.5

zbMATH Keywords

composition theoremsconical juntas

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 2033589
• Combinatorial generalizations of Jung's theorem
• A combinatorial property of convex sets
• scientific article; zbMATH DE number 38155
• Combinatorial convexity
• scientific article; zbMATH DE number 1846855
• Congruences of concave composition functions
• Convexity in combinatorial structures
• scientific article; zbMATH DE number 4050423
• Combinatorics and geometry of Littlewood-Richardson cones

Cited in

(12)

• Cone dependence -- a basic combinatorial concept
• Communication complexity with small advantage
• Query-to-communication lifting for BPP using inner product
• scientific article; zbMATH DE number 7250148 (Why is no real title available?)
• scientific article; zbMATH DE number 7250149 (Why is no real title available?)
• A composition theorem for randomized query complexity
• Separation between deterministic and randomized query complexity
• Query-to-communication lifting using low-discrepancy gadgets
• Rectangles are nonnegative juntas
• scientific article; zbMATH DE number 7758330 (Why is no real title available?)
• Randomized versus deterministic decision tree size
• Approximate degree composition for recursive functions

This page was built for publication:

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