Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Narváez, David E."'
Autor:
Carleton, Benjamin, Chavrimootoo, Michael C., Hemaspaandra, Lane A., Narváez, David E., Taliancich, Conor, Welles, Henry B.
Electoral control types are ways of trying to change the outcome of elections by altering aspects of their composition and structure [BTT92]. We say two compatible (i.e., having the same input types) control types that are about the same election sys
Externí odkaz:
http://arxiv.org/abs/2207.03049
Autor:
Carleton, Benjamin, Chavrimootoo, Michael C., Hemaspaandra, Lane A., Narváez, David E., Taliancich, Conor, Welles, Henry B.
[HHM20] discovered, for 7 pairs (C,D) of seemingly distinct standard electoral control types, that C and D are identical: For each input I and each election system, I is a Yes instance of both C and D, or of neither. Surprisingly this had gone undete
Externí odkaz:
http://arxiv.org/abs/2207.00710
For a graph $G$ and integers $a_i\ge 1$, the expression $G \rightarrow (a_1,\dots,a_r)^v$ means that for any $r$-coloring of the vertices of $G$ there exists a monochromatic $a_i$-clique in $G$ for some color $i \in \{1,\cdots,r\}$. The vertex Folkma
Externí odkaz:
http://arxiv.org/abs/2110.03121
Autor:
Nadjimzadah, Arian, Narváez, David E.
This is a commentary on, and critique of, Latif Salum's paper titled "Tractability of One-in-three $\mathrm{3SAT}$: $\mathrm{P} = \mathrm{NP}$." Salum purports to give a polynomial-time algorithm that solves the $\mathrm{NP}$-complete problem $\mathr
Externí odkaz:
http://arxiv.org/abs/2104.02886
We critique Javier Arroyo-Figueroa's paper titled ``The existence of the Tau one-way functions class as a proof that $\mathrm{P} \neq \mathrm{NP}$,'' which claims to prove $\mathrm{P} \neq \mathrm{NP}$ by showing the existence of a class of one-way f
Externí odkaz:
http://arxiv.org/abs/2103.15246
Computing theory analyzes abstract computational models to rigorously study the computational difficulty of various problems. Introductory computing theory can be challenging for undergraduate students, and the main goal of our research is to help st
Externí odkaz:
http://arxiv.org/abs/2012.01546
It is important to understand how the outcome of an election can be modified by an agent with control over the structure of the election. Electoral control has been studied for many election systems, but for all studied systems the winner problem is
Externí odkaz:
http://arxiv.org/abs/1811.05438
Autor:
Narváez, David E.
In the context of SAT solvers, Shatter is a popular tool for symmetry breaking on CNF formulas. Nevertheless, little has been said about its use in the context of AllSAT problems: problems where we are interested in listing all the models of a Boolea
Externí odkaz:
http://arxiv.org/abs/1711.06362
Backdoors and backbones of Boolean formulas are hidden structural properties. A natural goal, already in part realized, is that solver algorithms seek to obtain substantially better performance by exploiting these structures. However, the present pap
Externí odkaz:
http://arxiv.org/abs/1706.04582
Publikováno v:
In Information and Computation December 2021 281
