467 search results - page 36 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
COCO
2007
Springer
15 years 6 months ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
125
click to vote
ECCC
2011
14 years 6 months ago
2011
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
110
click to vote
STACS
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
136
click to vote
IWPEC
2010
Springer
14 years 9 months ago
2010
Springer
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
FLOPS
2010
Springer
15 years 6 months ago
2010
Springer
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show ...