Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Tawari, Anuj"'
Dynamic Complexity was introduced by Immerman and Patnaik \cite{PatnaikImmerman97} (see also \cite{DongST95}). It has seen a resurgence of interest in the recent past, see \cite{DattaHK14,ZeumeS15,MunozVZ16,BouyerJ17,Zeume17,DKMSZ18,DMVZ18,BarceloRZ1
Externí odkaz:
http://arxiv.org/abs/2008.05728
In 2015, it was shown that reachability for arbitrary directed graphs can be updated by first-order formulas after inserting or deleting single edges. Later, in 2018, this was extended for changes of size $\frac{\log n}{\log \log n}$, where $n$ is th
Externí odkaz:
http://arxiv.org/abs/2004.12739
Autor:
Mahajan, Meena, Tawari, Anuj
An arithmetic read-once formula (ROF) is a formula (circuit of fan-out 1) over $+,\times$ where each variable labels at most one leaf. Every multilinear polynomial can be expressed as the sum of ROFs. In this work, we prove, for certain multilinear p
Externí odkaz:
http://arxiv.org/abs/1603.02605
Autor:
Mahajan, Meena, Tawari, Anuj
An arithmetic read-once formula (ROF) is a formula (circuit of fan-out 1) over $+, \times$ where each variable labels at most one leaf. Every multilinear polynomial can be expressed as the sum of ROFs. In this work, we prove, for certain multilinear
Externí odkaz:
http://arxiv.org/abs/1512.04386
Autor:
Mahajan, Meena, Tawari, Anuj
Publikováno v:
In Theoretical Computer Science 17 January 2018 708:34-45
We study computation by formulas over (min,+). We consider the computation of max{x_1,...,x_n} over N as a difference of (min,+) formulas, and show that size n + n \log n is sufficient and necessary. Our proof also shows that any (min,+) formula comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e8007602a7b31767f9d148af1f99ad7
Publikováno v:
International Journal of Advances in Engineering Sciences & Applied Mathematics; Mar2019, Vol. 11 Issue 1, p68-74, 7p