Q5091781 (Q5091781): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Separations in query complexity using cheat sheets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separations in Query Complexity Based on Pointer Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5368738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An information statistics approach to data stream and communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Compress Interactive Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision trees with Boolean threshold queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4577913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Equals Amortized Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust polynomials and quantum algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved direct product theorems for randomized query complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential separation of communication and external information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Communication vs. Partition Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal direct sum results for deterministic and randomized decision tree complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-logarithmic depth lower bounds via the direct sum in communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amplification of One-Way Information Complexity via Codes and Noise Sensitivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Better Separation between Deterministic and Randomized Query Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Products and Help Bits in Decision Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards proving strong direct product theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Asymmetry in Constant-Depth Circuits / rank
 
Normal rank

Latest revision as of 17:52, 29 July 2024

scientific article; zbMATH DE number 7564429
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7564429

    Statements

    0 references
    0 references
    27 July 2022
    0 references
    decision trees
    0 references
    query complexity
    0 references
    communication complexity
    0 references

    Identifiers