Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Esther Ezra"'
Publikováno v:
Discrete & Computational Geometry. 68:997-1048
We present subquadratic algorithms, in the algebraic decision-tree model of computation, for detecting whether there exists a triple of points, belonging to three respective sets $A$, $B$, and $C$ of points in the plane, that satisfy a certain polyno
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::41e53dee0b9923710348b3b2954acacd
https://doi.org/10.1007/s00454-022-00437-1
https://doi.org/10.1007/s00454-022-00437-1
Publikováno v:
SIAM Journal on Discrete Mathematics. 36:958-974
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a3a278e10b2424e2f6d3948f8833084c
https://doi.org/10.1137/21m1409305
https://doi.org/10.1137/21m1409305
Publikováno v:
Computational Geometry, 109:101945. Elsevier
We present subquadratic algorithms in the algebraic decision-tree model for several 3SUM-hard geometric problems, all of which can be reduced to the following question: Given two sets A, B, each consisting of n pairwise disjoint segments in the plane
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ec1b8828eb5bd7404bb08fb39d04545f
https://doi.org/10.1016/j.comgeo.2022.101945
https://doi.org/10.1016/j.comgeo.2022.101945
Publikováno v:
SIAM Journal on Computing. 50:760-787
In 2015, Guth proved that if $\EuScript{S}$ is a collection of $n$ $g$-dimensional semialgebraic sets in ${\mathbb{R}}^d$ and if $D\geq 1$ is an integer, then there is a $d$-variate polynomial $P$ ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7bdfc6cc29300eb2568e063d9a4f22be
https://doi.org/10.1137/19m1268550
https://doi.org/10.1137/19m1268550
Publikováno v:
SIAM Journal on Computing. 49:1109-1127
In 2015, Guth proved that for any set of $k$-dimensional bounded complexity varieties in $\mathbb{R}^d$ and for any positive integer $D$, there exists a polynomial of degree at most $D$ whose zero set divides $\mathbb{R}^d$ into open connected sets,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::afff8bd4e967ce0b09c662f46684bbea
https://doi.org/10.1137/19m1257548
https://doi.org/10.1137/19m1257548
Publikováno v:
Discrete & Computational Geometry. 64:109-173
This work is motivated by several basic problems and techniques that rely on space decomposition of arrangements of hyperplanes in high-dimensional spaces, most notably Meiser’s 1993 algorithm (Meiser in Inf Comput 106(2):286–303, 1993) for point
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7b73e1fabefc7a337e3bd45cb780036f
https://doi.org/10.1007/s00454-019-00141-7
https://doi.org/10.1007/s00454-019-00141-7
Autor:
Esther Ezra
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030800482
CiE
CiE
We describe subquadratic algorithms, in the algebraic decision-tree model of computation, for detecting whether there exists a triple of points, belonging to three respective sets A, B, and C of points in the plane, that satisfy a pair of polynomial
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b924e57016616ee1e8d86be02add84d0
https://doi.org/10.1007/978-3-030-80049-9_16
https://doi.org/10.1007/978-3-030-80049-9_16
Autor:
Esther Ezra, Shachar Lovett
Publikováno v:
Random Structures & Algorithms. 54:665-675
Motivated by the Beck-Fiala conjecture, we study discrepancy bounds for random sparse set systems. Concretely, these are set systems (X,�), where each element x ∈ X lies in t randomly selected sets of �, where t is an integer parameter. We prov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::158a01c1fe3b0f6d432cb533b5001100
https://doi.org/10.1002/rsa.20810
https://doi.org/10.1002/rsa.20810
Autor:
Micha Sharir, Esther Ezra
Publikováno v:
Discrete & Computational Geometry. 61:735-755
We consider the point location problem in an arrangement of n arbitrary hyperplanes in any dimension d, in the linear decision tree model, in which we only count linear comparisons involving the query point, and all other operations do not explicitly
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3236b2521f6ed2408b85a1459b44c223
https://doi.org/10.1007/s00454-018-0043-8
https://doi.org/10.1007/s00454-018-0043-8