5624 search results - page 565 / 1125 » On Conditional Covering Problem |
221
click to vote
COMPGEOM
1994
ACM
15 years 11 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
161
click to vote
COCO
2010
Springer
15 years 11 months ago
2010
Springer
—We prove new lower bounds in the area of property testing of boolean functions. Specifically, we study the problem of testing whether a boolean function f is isomorphic to a ...
219
click to vote
SPW
2000
Springer
15 years 10 months ago
2000
Springer
In the context of the security of wireless ad hoc networks, we previously explored the problem of secure transient association between a master and a slave device in the absence of...
216
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
224
Voted
EFDBS
2000
15 years 8 months ago
2000
Today, bibliographical information is kept in a variety of data sources world wide, some of them publically available, and some of them also offering information about citations m...