Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Ebrahimnejad, Farzam"'
We study the complexity of approximating the permanent of a positive semidefinite matrix $A\in \mathbb{C}^{n\times n}$. 1. We design a new approximation algorithm for $\mathrm{per}(A)$ with approximation ratio $e^{(0.9999 + \gamma)n}$, exponentially
Externí odkaz:
http://arxiv.org/abs/2404.10959
Autor:
Ebrahimnejad, Farzam, Lee, James R.
We present an $O((\log n)^2)$-competitive algorithm for metrical task systems (MTS) on any $n$-point metric space that is also $1$-competitive for service costs. This matches the competitive ratio achieved by Bubeck, Cohen, Lee, and Lee (2019) and th
Externí odkaz:
http://arxiv.org/abs/2111.10908
Autor:
Ebrahimnejad, Farzam, Lee, James R.
Benjamini and Papasoglou (2011) showed that planar graphs with uniform polynomial volume growth admit $1$-dimensional annular separators: The vertices at graph distance $R$ from any vertex can be separated from those at distance $2R$ by removing at m
Externí odkaz:
http://arxiv.org/abs/2107.09790
We show that the ratio of the number of near perfect matchings to the number of perfect matchings in $d$-regular strong expander (non-bipartite) graphs, with $2n$ vertices, is a polynomial in $n$, thus the Jerrum and Sinclair Markov chain [JS89] mixe
Externí odkaz:
http://arxiv.org/abs/2103.08683
Autor:
Ebrahimnejad, Farzam, Lee, James R.
Consider an infinite planar graph with uniform polynomial growth of degree d > 2. Many examples of such graphs exhibit similar geometric and spectral properties, and it has been conjectured that this is necessary. We present a family of counterexampl
Externí odkaz:
http://arxiv.org/abs/2005.03139
Autor:
Ebrahimnejad, Farzam
Publikováno v:
Theor. Comput. Sci., 711 (2018) 79-91
A deterministic finite automaton (DFA) separates two strings $w$ and $x$ if it accepts $w$ and rejects $x$. The minimum number of states required for a DFA to separate $w$ and $x$ is denoted by $sep(w,x)$. The present paper shows that the difference
Externí odkaz:
http://arxiv.org/abs/1605.04835
Autor:
Ebrahimnejad, Farzam
Publikováno v:
In Theoretical Computer Science 8 February 2018 711:79-91
Autor:
Ebrahimnejad, Farzam, Lee, James R.
Publikováno v:
Discrete & Computational Geometry; Mar2024, Vol. 71 Issue 2, p627-645, 19p
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.
Autor:
Ebrahimnejad, Farzam1 (AUTHOR), Lee, James R.1 (AUTHOR) jrl@cs.washington.edu
Publikováno v:
Probability Theory & Related Fields. Aug2021, Vol. 180 Issue 3/4, p955-984. 30p.