Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



LATEST > REPORTS:
RSS-Feedprevious PreviousNext next

TR16-028 | 29th February 2016
Olaf Beyersdorff, Joshua Blinkhorn

Dependency Schemes in QBF Calculi:Semantics and Soundness

Revisions: 1

We study the parametrization of QBF resolution calculi by dependency schemes. One of the main problems in this area is to understand for which dependency schemes the resulting calculi are sound. Towards this end we propose a semantic framework for variable independence based on `exhibition' by QBF models, and use ... more >>>


TR16-027 | 10th February 2016
Sagnik Mukhopadhyay

Tribes Is Hard in the Message Passing Model

Revisions: 1

We consider the point-to-point message passing model of communication in which there are $k$ processors
with individual private inputs, each $n$-bit long. Each processor is located at the node of an underlying
undirected graph and has access to private random coins. An edge of the graph is a private channel ... more >>>


TR16-026 | 20th February 2016
Anindya De, Michael Saks, Sijian Tang

Noisy population recovery in polynomial time

In the noisy population recovery problem of Dvir et al., the goal is to learn
an unknown distribution $f$ on binary strings of length $n$ from noisy samples. For some parameter $\mu \in [0,1]$,
a noisy sample is generated by flipping each coordinate of a sample from $f$ independently with
more >>>



previous PreviousNext next


ISSN 1433-8092 | Imprint