Information complexity of the AND function in the two-party and multi-party settings (Q5919672): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q129557345, #quickstatements; #temporary_batch_1728777301724
 
(4 intermediate revisions by 3 users not shown)
description / endescription / en
scientific article; zbMATH DE number 7118908
scientific article; zbMATH DE number 6796725
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1434.68176 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-62389-4_17 / rank
 
Normal rank
Property / published in
 
Property / published in: Lecture Notes in Computer Science / rank
 
Normal rank
Property / publication date
 
23 October 2017
Timestamp+2017-10-23T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 23 October 2017 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6796725 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2598134248 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1703.07833 / 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: From information to exact communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information lower bounds via self-reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Equals Amortized Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4568116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NOF-Multiparty Information Complexity Bounds for Pointer Jumping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Results on Distributed Source Coding for Interactive Function Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Infinite-Message Limit of Two-Terminal Interactive Source Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distributional complexity of disjointness / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129557345 / rank
 
Normal rank

Latest revision as of 01:29, 13 October 2024

scientific article; zbMATH DE number 6796725
Language Label Description Also known as
English
Information complexity of the AND function in the two-party and multi-party settings
scientific article; zbMATH DE number 6796725

    Statements

    Information complexity of the AND function in the two-party and multi-party settings (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 October 2019
    0 references
    23 October 2017
    0 references
    information complexity
    0 references
    AND function
    0 references
    multi-party number-in-hand model
    0 references
    concavity condition
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references