1383 search results - page 213 / 277 » On the Complexity of the Interlace Polynomial |
120
click to vote
STOC
2005
ACM
16 years 2 months ago
2005
ACM
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
114
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We present a range of new results for testing properties of Boolean functions that are defined in terms of the Fourier spectrum. Broadly speaking, our results show that the propert...
197
click to vote
VLDB
2002
ACM
16 years 2 months ago
2002
ACM
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
126
click to vote
ICS
2010
Tsinghua U.
15 years 11 months ago
2010
Tsinghua U.
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
129
click to vote
VMCAI
2010
Springer
15 years 11 months ago
2010
Springer
We present a unified game-based approach for branching-time model checking of hierarchical systems. Such systems are exponentially more succinct than standard state-transition gra...