#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2012

2018

- This year (3)
- Last 5 years (10)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Joshua Brakensiek, Venkatesan Guruswami, Samuel Zbarsky
- IEEE Transactions on Information Theory
- 2015

We consider the problem of constructing binary codes to recover from <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>â€“bit deletions with efficient encoding/decoding, for aâ€¦ (More)

- Joshua Brakensiek, Venkatesan Guruswami
- Conference on Computational Complexity
- 2016

Finding a proper coloring of a t-colorable graph G with t colors is a classic NP-hard problem when t â‰¥ 3. In this work, we investigate the approximate coloring problem in which the objective is toâ€¦ (More)

- Joshua Brakensiek, Venkatesan Guruswami
- APPROX-RANDOM
- 2017

The Unique Games Conjecture (UGC) has pinned down the approximability of all constraint satisfaction problems (CSPs), showing that a natural semidefinite programming relaxation offers the optimalâ€¦ (More)

- Joshua Brakensiek, Venkatesan Guruswami
- SODA
- 2018

- Joshua Brakensiek, Venkatesan Guruswami
- Electronic Colloquium on Computational Complexity
- 2016

A classic result due to Schaefer (1978) classifies all constraint satisfaction problems (CSPs) over the Boolean domain as being either in P or NP-hard. This paper considers a promise-problem variantâ€¦ (More)

- Joshua Brakensiek, Venkatesan Guruswami
- ArXiv
- 2018

Promise CSPs are a relaxation of constraint satisfaction problems where the goal is to find an assignment satisfying a relaxed version of the constraints. Several well known problems can be cast asâ€¦ (More)

Bounds on the Size of Sound Monotone Switching Networks Accepting Permutation Sets of Directed Trees

- Joshua Brakensiek, Aaron Potechin
- ArXiv
- 2012

Given a directed graph G as input with labeled nodes s and t, the ST-connectivity problem asks whether s and t are connected. The memory efficiency of an algorithm which solves this problem can beâ€¦ (More)

- Matthew Babbitt, Jesse Geneson, +4 authors Katherine Cordwell
- 2012

We examine several types of visibility graphs: bar and semi bar k-visibility graphs, arc and circle k-visibility graphs, and compact visibility graphs. We improve the upper bound on the thickness ofâ€¦ (More)

Since our success probability dependents on the probabilities p1, . . . , pn, we call this problem the Average-Case Model. We desire to select the optimal POVM (E1, . . . , Em) so that ourâ€¦ (More)

- Joshua Brakensiek, Venkatesan Guruswami
- Electronic Colloquium on Computational Complexity
- 2018

Promise CSPs are a relaxation of constraint satisfaction problems where the goal is to find an assignment satisfying a relaxed version of the constraints. Several well known problems can be cast asâ€¦ (More)