Zobrazeno 1 - 10
of 332
pro vyhledávání: '"Richard J. Lipton"'
Publikováno v:
45th International Symposium on Symbolic and Algebraic Computation (ISSAC)
Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation
ISSAC
ISSAC '20
Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation
ISSAC
ISSAC '20
The Skolem Problem asks, given a linear recurrence sequence $(u_n)$, whether there exists $n\in\mathbb{N}$ such that $u_n=0$. In this paper we consider the following specialisation of the problem: given in addition $c\in\mathbb{N}$, determine whether
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16fa0bc1085000b30e4aec79bff84e13
Autor:
Richard J. Lipton, Kenneth W. Regan
Quantum computing explained in terms of elementary linear algebra, emphasizing computation and algorithms and requiring no background in physics.This introduction to quantum algorithms is concise but comprehensive, covering many key algorithms. It is
Autor:
Richard J. Lipton, Eric B. Baum
This volume presents the proceedings of a conference held at Princeton University in April 1995 as part of the DIMACS Special Year on Mathematical Support for Molecular Biology. The subject of the conference was the new area of DNA based computing. D
Publikováno v:
Journal of Graph Algorithms and Applications. 17:567-573
The celebrated Four-Color Theorem was rst conjectured in the 1850’s. Since then there had been many partial results. More than a century later, it was rst proved by Appel and Haken [1] and then subsequently improved by Robertson et al. [8]. These p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5f426ac4ac2106b66680730b1ecc9a00
https://doi.org/10.7155/jgaa.00304
https://doi.org/10.7155/jgaa.00304
Autor:
Eric B. Schneider, Alireza Najafian, Vladimir Neychev, Maher Ghanem, Patricia Aragon Han, Jay H. Klarsfeld, Stuart Blackwood, Michael C. Bard, Dov C. Bloch, Martha A. Zeiger, Roghayeh Fazeli, Richard J. Lipton
Publikováno v:
International journal of surgery (London, England). 32
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::048089af9f1ced4e4dd4ea6b8f469a78
https://pubmed.ncbi.nlm.nih.gov/27321807
https://pubmed.ncbi.nlm.nih.gov/27321807
Publikováno v:
Theoretical Computer Science. 417:66-73
The standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one essentially searches a large bounded-degree graph whose size is exponential in the running time of the NTM. The graph is the natural one defined by the configur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e1f4462ea848013eb4ed4f562190a731
https://doi.org/10.1016/j.tcs.2011.05.018
https://doi.org/10.1016/j.tcs.2011.05.018
Publikováno v:
Proceedings of the VLDB Endowment. 3:1114-1124
We propose the k -representative regret minimization query ( k -regret) as an operation to support multi-criteria decision making. Like top- k , the k -regret query assumes that users have some utility or scoring functions; however, it never asks the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0dadfabdd5dd843f4e1046fc15d2df0
https://doi.org/10.14778/1920841.1920980
https://doi.org/10.14778/1920841.1920980
Autor:
Aranyak Mehta, Richard J. Lipton, Nisheeth K. Vishnoi, Mihail N. Kolountzakis, Evangelos Markakis
Publikováno v:
Combinatorica. 29:363-387
We study the following question What is the smallest t such that every symmetric boolean function on κ variables (which is not a constant or a parity function), has a non-zero Fourier coefficient of order at least 1 and at most t? We exclude the con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f8806725feae869b4504bb46b50be663
https://doi.org/10.1007/s00493-009-2310-z
https://doi.org/10.1007/s00493-009-2310-z
Publikováno v:
Information Processing Letters. 109:187-192
We present two deterministic algorithms for the arithmetic circuit identity testing problem. The running time of our algorithms is polynomially bounded in s and m, where s is the size of the circuit and m is an upper bound on the number monomials wit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::edb97b2904fafa119067c8ff23afc3bb
https://doi.org/10.1016/j.ipl.2008.09.029
https://doi.org/10.1016/j.ipl.2008.09.029
Autor:
Richard J. Lipton, Kenneth W. Regan
Quantum computing explained in terms of elementary linear algebra, emphasizing computation and algorithms and requiring no background in physics.This introduction to quantum algorithms is concise but comprehensive, covering many key algorithms. It is