Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Joshua A Grochow"'
Autor:
Raja Jothi, S Balaji, Arthur Wuster, Joshua A Grochow, Jörg Gsponer, Teresa M Przytycka, L Aravind, M Madan Babu
Publikováno v:
Molecular Systems Biology, Vol 5, Iss 1, Pp 1-15 (2009)
Abstract Although several studies have provided important insights into the general principles of biological networks, the link between network organization and the genome‐scale dynamics of the underlying entities (genes, mRNAs, and proteins) and i
Externí odkaz:
https://doaj.org/article/566319d3c18c406dbdba2b134d6b2a97
Publikováno v:
Groups, Complexity, Cryptology, Vol Volume 14, Issue 1 (2022)
We study the problems of testing isomorphism of polynomials, algebras, and multilinear forms. Our first main results are average-case algorithms for these problems. For example, we develop an algorithm that takes two cubic forms $f, g\in \mathbb{F}_q
Externí odkaz:
https://doaj.org/article/821a451c6f5047f5836055840bd95dd7
Autor:
Joshua A. Grochow
There is no single canonical polynomial-time version of the Axiom of Choice (AC); several statements of AC that are equivalent in Zermelo-Fraenkel (ZF) set theory are already inequivalent from a constructive point of view, and are similarly inequival
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b5d4bb8dec59b51342f2014445eddf84
http://arxiv.org/abs/2301.07123
http://arxiv.org/abs/2301.07123
Autor:
Jonah Blasiak, Thomas Church, Henry Cohn, Joshua A. Grochow, Eric Naslund, William F. Sawin, Chris Umans
Publikováno v:
Discrete Analysis (2017)
On cap sets and the group-theoretic approach to matrix multiplication, Discrete Analysis 2017:3, 27pp. A famous problem in computational complexity is to obtain a good estimate for the number of operations needed to compute the product of two $n\tim
Externí odkaz:
https://doaj.org/article/430cf2768d7a4008a45911cc7d92b990
Autor:
Daniel B. Larremore, Caterina De Bacco, Yoav Kallus, Andrew Berdahl, Brendan D. Tracey, Eleanor A. Power, Vanessa Ferdinand, Caitlin A. Stern, Eric Libby, Marion Dumas, Joshua A. Grochow, Christopher P. Kempes, Artemy Kolchinsky, Laurent Hébert-Dufresne, Christa Brelsford
Publikováno v:
Scientific Reports, Vol 9, Iss 1, Pp 1-9 (2019)
Scientific Reports
Scientific Reports
Pathogens can spread epidemically through populations. Beneficial contagions, such as viruses that enhance host survival or technological innovations that improve quality of life, also have the potential to spread epidemically. How do the dynamics of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::06d13ececd27362e51515bb6dd2a4823
http://link.springer.com/article/10.1038/s41598-019-50039-w
http://link.springer.com/article/10.1038/s41598-019-50039-w
Autor:
Timothée Poisot, Richard J. Williams, Jennifer A. Dunne, Tamara N. Romanuk, Daijiang Li, Spencer A. Wood, Benjamin Baiser, Joshua A. Grochow, Alicia McGrew, Justin D. Yeakel, Alyssa R. Cirtwill, Neo D. Martinez, Lauren B. Trotta, Ashkaan K. Fahimipour, Daniel B. Stouffer, Fernanda S. Valdovinos, Luis J. Gilarranz, Dominique Gravel
Publikováno v:
Global Ecology and Biogeography. 28:1204-1218
Author(s): Baiser, B; Gravel, D; Cirtwill, AR; Dunne, JA; Fahimipour, AK; Gilarranz, LJ; Grochow, JA; Li, D; Martinez, ND; McGrew, A; Poisot, T; Romanuk, TN; Stouffer, DB; Trotta, LB; Valdovinos, FS; Williams, RJ; Wood, SA; Yeakel, JD | Abstract: Aim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc6f75131120469b63bb1f2901e7133d
https://doi.org/10.1111/geb.12925
https://doi.org/10.1111/geb.12925
Publikováno v:
Entropy, Vol 19, Iss 7, p 310 (2017)
In the past three decades, many theoretical measures of complexity have been proposed to help understand complex systems. In this work, for the first time, we place these measures on a level playing field, to explore the qualitative similarities and
Externí odkaz:
https://doaj.org/article/ac3cd41ba5f040cc902a10430288a80e
Autor:
Toniann Pitassi, Joshua A. Grochow
Publikováno v:
Journal of the ACM. 65:1-59
We introduce a new and natural algebraic proof system, whose complexity measure is essentially the algebraic circuit size of Nullstellensatz certificates. This enables us to exhibit close connections between effective Nullstellensatzë, proof complex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0194d8f90a6487cc37db0616330a1011
https://doi.org/10.1145/3230742
https://doi.org/10.1145/3230742
Autor:
Joshua A. Grochow
Publikováno v:
Bulletin of the American Mathematical Society. 56:29-64
The cap set problem asks how large can a subset of ( Z / 3 Z ) n (\mathbb {Z}/3\mathbb {Z})^n be and contain no lines or, more generally, how can large a subset of ( Z / p Z ) n (\mathbb {Z}/p\mathbb {Z})^n be and contain no arithmetic progressions.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5799e22d445583e80fdb5f5a8565d405
https://doi.org/10.1090/bull/1648
https://doi.org/10.1090/bull/1648
Autor:
David H. Wolpert, Joshua A. Grochow
Publikováno v:
ACM SIGACT News. 49:33-56
Recent advances in nonequilibrium statistical mechanics have led to a deeper understanding of the thermodynamic cost of computation than that put forth by Landauer and then studied extensively in the computational complexity community. In particular,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::51fd1b111e59fb8a4f9cc9866c33bcf1
https://doi.org/10.1145/3232679.3232689
https://doi.org/10.1145/3232679.3232689