#### Filter Results:

#### Publication Year

2012

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Well quasi-orders (wqo's) are an important mathematical tool for proving termination of many algorithms. Under some assumptions upper bounds for the computational complexity of such algorithms can be extracted by analyzing the length of controlled bad sequences. We develop a new, self-contained study of the length of bad sequences over the product ordering… (More)

The question of how large Bell inequality violations can be, for quantum distributions, has been the object of much work in the past several years. We say a Bell inequality is normalized if its absolute value does not exceed 1 for any classical (i.e. local) distribution. Upper and (almost) tight lower bounds have been given in terms of number of outputs of… (More)

We study the length functions of controlled bad sequences over some well quasi-orders (wqo's) and classify them in the Fast Growing Hierarchy. We develop a new and self-contained study of the length of bad sequences over the disjoint product in N n (Dickson's Lemma), which leads to recently discovered upper bounds but through a simpler argument. We also… (More)

- ‹
- 1
- ›