Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > MAXIMUM MATCHING:
Reports tagged with maximum matching:
TR16-111 | 20th July 2016
Amit Chakrabarti, Sagar Kale

#### Strong Fooling Sets for Multi-Player Communication with Applications to Deterministic Estimation of Stream Statistics

We develop a paradigm for studying multi-player deterministic communication,
based on a novel combinatorial concept that we call a {\em strong fooling
communication required for solving multi-player $\textsc{equality}$
problems in a private-message setting. This in turn gives a ... more >>>

TR19-101 | 24th July 2019
Amit Chakrabarti, Prantar Ghosh

#### Streaming Verification of Graph Computations via Graph Structure

We give new algorithms in the annotated data streaming setting---also known as verifiable data stream computation---for certain graph problems. This setting is meant to model outsourced computation, where a space-bounded verifier limited to sequential data access seeks to overcome its computational limitations by engaging a powerful prover, without needing to ... more >>>

ISSN 1433-8092 | Imprint