607 search results - page 3 / 122 » Unifying Exact Completions |
45
Voted
ICCAD
1994
IEEE
15 years 2 months ago
1994
IEEE
JSYML
2002
14 years 10 months ago
2002
MST
2006
14 years 10 months ago
2006
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
ISTCS
1997
Springer
15 years 2 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
FORMATS
2004
Springer
15 years 2 months ago
2004
Springer
Davies and Wakerly show that Byzantine fault tolerance can be achieved by a cascade of broadcasts and middle value select functions. We present an extension of the Davies and Waker...