Simulation theorems via pseudo-random properties (Q2281252): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963260788 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1704.06807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Compress Interactive Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness amplification in proof complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strong direct product theorem for corruption and the multiparty communication complexity of disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Equals Amortized Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Product via Round-Preserving Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a reverse Newman's theorem in interactive information complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3568106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NOF Multiparty Communication Complexity of Composed Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Elimination via Weak Regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query-To-Communication Lifting for BPP Using Inner Product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Separations between Nondeterministic and Randomized Multiparty Communication / 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: A short proof for a theorem of Harper about Hamming-spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectangles Are Nonnegative Juntas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication lower bounds via critical block sensitivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Communication vs. Partition Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query-to-Communication Lifting for BPP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal numberings and isoperimetric problems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Communication Complexity of Correlation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure of Protocols for XOR Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the virtue of succinct proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Strong Direct Product Results in Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct product theorem for two-party bounded-round public-coin communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth Lower Bounds for Monotone Semi-Unbounded Fan-in Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Circuits for Connectivity Require Super-Logarithmic Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composition Theorems in Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: One way functions and pseudorandom generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting Theorems for Equality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4601824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation of the monotone NC hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards proving strong direct product theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating ${AC}^0$ from Depth-2 Majority Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pattern Matrix Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiparty communication complexity of set disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Direct Product Theorems for Quantum Communication and Query Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication lower bounds using directional derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3633949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dag-like communication and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank
 
Normal rank

Latest revision as of 07:25, 21 July 2024

scientific article
Language Label Description Also known as
English
Simulation theorems via pseudo-random properties
scientific article

    Statements

    Simulation theorems via pseudo-random properties (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 December 2019
    0 references
    communication complexity
    0 references
    lifting theorem
    0 references
    simulation theorem
    0 references
    inner product
    0 references
    gap-Hamming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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