1127 search results - page 169 / 226 » Theory Extension in ACL2(r) |
168
click to vote
COCO
2005
Springer
15 years 11 months ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
180
click to vote
OOPSLA
2005
Springer
15 years 11 months ago
2005
Springer
Generalized algebraic data types (GADTs) have received much attention recently in the functional programming community. They generalize the (type) parameterized algebraic datatype...
148
click to vote
RTA
2005
Springer
15 years 11 months ago
2005
Springer
Proofs of equalities may be built from assumptions using proof rules for reflexivity, symmetry, and transitivity. Reflexivity is an axiom proving x=x for any x; symmetry is a 1-p...
168
click to vote
SENSYS
2004
ACM
15 years 11 months ago
2004
ACM
Previous approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-count...
162
click to vote
ACISP
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we study the problem of single database private information retrieval, and present schemes with only logarithmic server-side communication complexity. Previously th...