3,563 research outputs found
Extensions of the Spending Constraint Model: Existence and Uniqueness of Equilibria (Extended Abstract)
No full textNikhil R. Devanur [email protected] Vijay V. Vazirani [email protected] College of Computing, Georgia Institute of Technology
Book Review on: Implicit parallel programming in pH, by R. S. Nikhil and Arvind, Morgan Kaufmann, 2001
No full textBook Review on: Implicit parallel programming in pH, by R. S. Nikhil and Arvind, Morgan Kaufmann, 2001 . Journal of Functional Programmin
Book Review on: Implicit parallel programming in pH, by R. S. Nikhil and Arvind, Morgan Kaufmann, 2001
No full textBook Review on: Implicit parallel programming in pH, by R. S. Nikhil and Arvind, Morgan Kaufmann, 2001 . Journal of Functional Programmin
sj-png-1-nah-10.1177_02601060221139628 - Supplemental material for Unwinding the potentials of vitamin C in COVID-19 and other diseases: An updated review
No full textSupplemental material, sj-png-1-nah-10.1177_02601060221139628 for Unwinding the potentials of vitamin C in COVID-19 and other diseases: An updated review by Nikhil Mehta, Purvi Pokharna and Saritha R Shetty in Nutrition and Health</p
sj-docx-1-heb-10.1177_10901981241239933 – Supplemental material for Predictors of U.S. Adults’ Opinion Toward an R-Rating Policy for Movies With Cigarette Smoking
No full textSupplemental material, sj-docx-1-heb-10.1177_10901981241239933 for Predictors of U.S. Adults’ Opinion Toward an R-Rating Policy for Movies With Cigarette Smoking by Nikhil Ahuja, Asos Mahmood, Satish Kedia and Patrick J. Dillon in Health Education & Behavior</p
Spectral asymptotics for coupled Dirac operators
No full textThesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2012.Cataloged from PDF version of thesis.Includes bibliographical references (p. 137-139).In this thesis, we study the problem of asymptotic spectral flow for a family of coupled Dirac operators. We prove that the leading order term in the spectral flow on an n dimensional manifold is of order r n+1/2 followed by a remainder of O(r n/2). We perform computations of spectral flow on the sphere which show that O(r n-1/2) is the best possible estimate on the remainder. To obtain the sharp remainder we study a semiclassical Dirac operator and show that its odd functional trace exhibits cancellations in its first n+3/2 terms. A normal form result for this Dirac operator and a bound on its counting function are also obtained.by Nikhil Savale.Ph.D
Imperfect Gaps in Gap-ETH and PCPs
No full textWe study the role of perfect completeness in probabilistically checkable proof systems (PCPs) and give a way to transform a PCP with imperfect completeness to one with perfect completeness, when the initial gap is a constant. We show that PCP_{c,s}[r,q] subseteq PCP_{1,s'}[r+O(1),q+O(r)] for c-s=Omega(1) which in turn implies that one can convert imperfect completeness to perfect in linear-sized PCPs for NP with a O(log n) additive loss in the query complexity q. We show our result by constructing a "robust circuit" using threshold gates. These results are a gap amplification procedure for PCPs, (when completeness is not 1) analogous to questions studied in parallel repetition [Anup Rao, 2011] and pseudorandomness [David Gillman, 1998] and might be of independent interest.
We also investigate the time-complexity of approximating perfectly satisfiable instances of 3SAT versus those with imperfect completeness. We show that the Gap-ETH conjecture without perfect completeness is equivalent to Gap-ETH with perfect completeness, i.e. MAX 3SAT(1-epsilon,1-delta), delta > epsilon has 2^{o(n)} algorithms if and only if MAX 3SAT(1,1-delta) has 2^{o(n)} algorithms. We also relate the time complexities of these two problems in a more fine-grained way to show that T_2(n) <= T_1(n(log log n)^{O(1)}), where T_1(n),T_2(n) denote the randomized time-complexity of approximating MAX 3SAT with perfect and imperfect completeness respectively
Near-Optimal Complexity Bounds for Fragments of the Skolem Problem
No full textGiven a linear recurrence sequence (LRS), specified using the initial conditions and the recurrence relation, the Skolem problem asks if zero ever occurs in the infinite sequence generated by the LRS. Despite active research over last few decades, its decidability is known only for a few restricted subclasses, by either restricting the order of the LRS (upto 4) or by restricting the structure of the LRS (e.g., roots of its characteristic polynomial).
In this paper, we identify a subclass of LRS of arbitrary order for which the Skolem problem is easy, namely LRS all of whose characteristic roots are (possibly complex) roots of real algebraic numbers, i.e., roots satisfying x^d = r for r real algebraic. We show that for this subclass, the Skolem problem can be solved in NP^RP. As a byproduct, we implicitly obtain effective bounds on the zero set of the LRS for this subclass. While prior works in this area often exploit deep results from algebraic and transcendental number theory to get such effective results, our techniques are primarily algorithmic and use linear algebra and Galois theory. We also complement our upper bounds with a NP lower bound for the Skolem problem via a new direct reduction from 3-CNF-SAT, matching the best known lower bounds
Supplemental Material - Implications of pediatric extracorporeal cardiopulmonary resuscitation simulation for intensive care team confidence and coordination: A pilot study
No full textSupplemental Material for Implications of pediatric extracorporeal cardiopulmonary resuscitation simulation for intensive care team confidence and coordination: A pilot study by Toluwani Akinpelu, Nikhil R Shah, Karen Weaver, Nicole Muller, James McElroy and Utpal S Bhalala in Perfusion</p
- …
