#### Filter Results:

#### Publication Year

2007

2011

#### Publication Type

#### Publication Venue

#### Key Phrases

Learn More

- Eric Purdy
- 2008

We examine the hardness of approximating constraint satisfaction problems with k-variable constraints, known as k-CSP's. We are specifically interested in k-CSP's whose constraints are unique, which means that for any assignment to any k − 1 of the variables, there is a unique assignment to the last variable satisfying the constraint. One fundamental… (More)

- Eric Purdy
- TOCT
- 2011

Among a set of <i>n</i> coins of two weights (good and bad), and using a balance, we wish to determine the number of bad coins using as few measurements as possible. There is a known adaptive decision tree that answers this question in <i>O</i>((log(<i>n</i>))<sup>2</sup>) measurements, and a slight modification of this decision tree determines the parity… (More)

- Eric Purdy
- 2007

Among a set of n coins of two weights (good and bad), and using a balance, we wish to determine the number of bad coins using as few measurements as possible. There is a known adaptive decision tree that answers this question in O((log(n)) 2) measurements, and a slight modification of this decision tree determines the parity of the number of bad coins in… (More)

- ‹
- 1
- ›