4488 search results - page 522 / 898 » Properties of NP-Complete Sets |
230
Voted
CADE
2005
Springer
16 years 7 months ago
2005
Springer
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...
202
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...
169
click to vote
EDBT
2008
ACM
16 years 7 months ago
2008
ACM
In this paper we study the problem of mining all frequent queries in a given database table, a problem known to be intractable even for conjunctive queries. We restrict our attent...
188
click to vote
PERCOM
2008
ACM
16 years 7 months ago
2008
ACM
Low cost devices such as RFIDs, sensor network nodes, and smartcards are crucial for building the next generation pervasive and ubiquitous networks. The inherent power and footpri...
194
click to vote
DCC
2005
IEEE
16 years 7 months ago
2005
IEEE
Functions which map n-bits to m-bits are important cryptographic sub-primitives in the design of additive stream ciphers. We construct highly nonlinear t-resilient such functions (...