Joshua Brakensiek

activity

20132026

most citedEfficient Geometric Probabilities of Multi-Transiting Exoplanetary Systems from CORBITS

48 citations · 103 across the 33 of their papers we have counts for

collaborators

Showing 2026 · cs.CCShow all

3 papers · 2 filters

cs.CC2026

Cores Characterize the One-Pass Streaming Complexity of CSPs

Joshua Brakensiek, Aaron Putterman, Amatya Sharma +1

We study the one-pass streaming complexity of CSPs over a fixed finite relation $R$ under three natural objectives: $SAT (R)$ , deciding whether all constraints can be satis…

cs.CC2026

Separating Non-redundancy and Chain Length

Joshua Brakensiek, Venkatesan Guruswami, Aaron Putterman

For a constraint satisfaction problem defined by a relation $R$ , its non-redundancy $NRD (R, n)$ is the size of largest instance (as a function of the number $n$ of variables)…

cs.CC2026

Classification of Non-redundancy of Boolean Predicates of Arity 4

Joshua Brakensiek, Venkatesan Guruswami, Aaron Putterman

Given a constraint satisfaction problem (CSP) predicate $P \subseteq D^{r}$ , the non-redundancy (NRD) of $P$ is maximum-sized instance on $n$ variables such that for every clause of…