Jake L. Wellens

activity

20142020

most citedA tighter bound on the number of relevant variables in a bounded degree Boolean function

4 citations · 11 across the 8 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2020

Regarding two conjectures on clique and biclique partitions

Dhruv Rohatgi, John C. Urschel, Jake Wellens

For a graph $G$ , let $c p (G)$ denote the minimum number of cliques of $G$ needed to cover the edges of $G$ exactly once. Similarly, let $b p_{k} (G)$ denote the minimum number of bicliq…

math.CO2020

Relationships between the number of inputs and other complexity measures of Boolean functions

Jake Wellens

We generalize and extend the ideas in a recent paper of Chiarelli, Hatami and Saks to prove new bounds on the number of relevant variables for boolean functions in terms of a varie…

math.CO2019

Testing Gap k-planarity is NP-complete

John C. Urschel, Jake Wellens

For all $k \geq 1$ , we show that deciding whether a graph is $k$ -planar is NP-complete, extending the well-known fact that deciding 1-planarity is NP-complete. Furthermore, we show…