Zobrazeno 1 - 10
of 153
pro vyhledávání: '"3SUM problem"'
Autor:
Muhamed Retkoceri
Publikováno v:
International Journal of Business & Technology. 3:13-15
In this paper is presented an algorithm for solving 3SUM problem efficiently in general computation model. The algorithm is based on sorting and splits the task into sub-tasks where this approach enables the algorithm to run concurrently at the high-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fbb975f542be2db92847b5297a4bc1dc
https://doi.org/10.33107/ijbte.2015.3.2.02
https://doi.org/10.33107/ijbte.2015.3.2.02
Autor:
Ambainis, Andris, Larka, Nikita
We study quantum algorithms for problems in computational geometry, such as POINT-ON-3-LINES problem. In this problem, we are given a set of lines and we are asked to find a point that lies on at least $3$ of these lines. POINT-ON-3-LINES and many ot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::278b239d5bbaa4ddad4fcbcda95e1b5e
http://arxiv.org/abs/2004.08949
http://arxiv.org/abs/2004.08949
Autor:
Chung, Eldon
In this thesis, we study extensions of statistical cryptographic primitives. In particular we study leakage-resilient secret sharing, non-malleable extractors, and immunized ideal one-way functions. The thesis is divided into three main chapters. In
Externí odkaz:
http://arxiv.org/abs/2406.16313
We prove 3SUM-hardness (no strongly subquadratic-time algorithm, assuming the 3SUM conjecture) of several problems related to finding Abelian square and additive square factors in a string. In particular, we conclude conditional optimality of the sta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::13313f1e21ee40b96fdcc41c404e4ae2
Autor:
GRØNLUND, ALLAN1 jallan@cs.au.dk, PETTIE, SETH2 pettie@umich.edu
Publikováno v:
Journal of the ACM. Apr2018, Vol. 65 Issue 4, p1-25. 25p.
Conference
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:
Fiedler, Heinz
Dans ce mémoire, nous proposons des protocoles cryptographiques d'échange de clef, de mise en gage, et de transfert équivoque. Un premier protocole de transfert équivoque, primitive cryptographique universelle pour le calcul multi-parties, s'insp
Externí odkaz:
http://hdl.handle.net/1866/9164
The 3SUM problem is one of the cornerstones of fine-grained complexity. Its study has led to countless lower bounds, but as has been sporadically observed before -- and as we will demonstrate again -- insights on 3SUM can also lead to algorithmic app
Externí odkaz:
http://arxiv.org/abs/2410.20764
We revisit the 3SUM problem in the \emph{preprocessed universes} setting. We present an algorithm that, given three sets $A$, $B$, $C$ of $n$ integers, preprocesses them in quadratic time, so that given any subsets $A' \subseteq A$, $B' \subseteq B$,
Externí odkaz:
http://arxiv.org/abs/2410.16784
Many computational problems are subject to a quantum speed-up: one might find that a problem having an O(n^3)-time or O(n^2)-time classic algorithm can be solved by a known O(n^1.5)-time or O(n)-time quantum algorithm. The question naturally arises:
Externí odkaz:
http://arxiv.org/abs/2106.02005