Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Abascal, Jackson"'
We give an efficient algorithm to strongly refute \emph{semi-random} instances of all Boolean constraint satisfaction problems. The number of constraints required by our algorithm matches (up to polylogarithmic factors) the best-known bounds for effi
Externí odkaz:
http://arxiv.org/abs/2009.08032
We present a new $O(k^2 \binom{n}{k}^2)$ method for generating an orthogonal basis of eigenvectors for the Johnson graph $J(n,k)$. Unlike standard methods for computing a full eigenbasis of sparse symmetric matrices, the algorithm presented here is n
Externí odkaz:
http://arxiv.org/abs/1812.04230
Autor:
Abascal, Jackson, Maimon, Shir
We review Andr\'e Luiz Barbosa's paper "P != NP Proof," in which the classes P and NP are generalized and claimed to be proven separate. We highlight inherent ambiguities in Barbosa's definitions, and show that attempts to resolve this ambiguity lead
Externí odkaz:
http://arxiv.org/abs/1711.07132
Autor:
Abascal, Jackson, Maimon, Shir
In this work, we summarize and critique the paper "Understanding SAT is in P" by Alejandro S\'anchez Guinea [arXiv:1504.00337]. The paper claims to present a polynomial-time solution for the NP-complete language 3-SAT. We show that Guinea's algorithm
Externí odkaz:
http://arxiv.org/abs/1711.04412
The rankable and compressible sets have been studied for more than a quarter of a century, ever since Allender [1] and Goldberg and Sipser [6] introduced the formal study of polynomial-time ranking. Yet even after all that time, whether the rankable
Externí odkaz:
http://arxiv.org/abs/1611.01696
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.