29908 search results - page 283 / 5982 » On the complexity of communication complexity |
171
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
212
click to vote
DCC
2011
IEEE
15 years 1 months ago
2011
IEEE
Abstract Many attacks on encryption schemes rely on statistical considerations using plaintext/ciphertext pairs to find some information on the key. We provide here simple formula...
185
click to vote
ECCC
2011
15 years 1 months ago
2011
An input-oblivious proof system is a proof system in which the proof does not depend on the claim being proved. Input-oblivious versions of NP and MA were introduced in passing by...
175
click to vote
JAT
2010
15 years 1 months ago
2010
We describe the theoretical solution of an approximation problem that uses a finite weighted sum of complex exponential functions. The problem arises in an optimization model for t...
171
click to vote
TSP
2010
15 years 1 months ago
2010
We derive the entropy rate formula for a complex Gaussian random process by using a widely linear model. The resulting expression is general and applicable to both circular and non...