2976 search results - page 209 / 596 » On the bounded integer programming |
171
click to vote
ICALP
2005
Springer
16 years 3 hour ago
2005
Springer
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
196
click to vote
FORMATS
2004
Springer
15 years 12 months ago
2004
Springer
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this reg...
161
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
173
click to vote
ISSTA
2010
ACM
15 years 8 months ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
176
click to vote
IJCAI
2007
15 years 8 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...