1199 search results - page 96 / 240 » Parameterized Proof Complexity |
ICALP
2003
Springer
14 years 3 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
STOC
2007
ACM
14 years 10 months ago
2007
ACM
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...
CEC
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract— Target shape design optimization problem (TSDOP) is a miniature model for real world design optimization problems. It is proposed as a test bed to design and analyze op...
COCOON
2009
Springer
14 years 4 months ago
2009
Springer
We introduce overlap cluster graph modification problems where, other than in most previous work, the clusters of the target graph may overlap. More precisely, the studied graph p...
FSTTCS
2007
Springer
14 years 4 months ago
2007
Springer
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...