38 search results - page 1 / 8 » Direct Product Results and the GCD Problem, in Old and New C... |
STOC
1997
ACM
13 years 9 months ago
1997
ACM
This paper contains several results regarding the communication complexity model and the 2-prover games model, which are based on interaction between the two models:
ECCC
2011
13 years 10 days ago
2011
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
COCO
2008
Springer
13 years 7 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
HICSS
2002
IEEE
13 years 10 months ago
2002
IEEE
The management of healthcare organizations starts to recognize the relevance of the definition of care products in relation to management information. In the turmoil between costs...
CSDA
2008
13 years 5 months ago
2008
An algorithm for time-adaptive quantile regression is presented. The algorithm is based on the simplex algorithm, and the linear optimization formulation of the quantile regressio...