Frederic Magniez and Triangle - Free people check

(1 - 6 from 6

)

[quant-ph ] Quantum Algorithms for the Triangle Problem

arxiv.org

Submission history From: Frederic Magniez Tue, 21 Oct :26:16 GMT (7kb) Fri, 7 Nov :16:27 GMT (8kb) [v3] Wed, 14 Dec :50:15 GMT (17kb)

[ v1] Improved Quantum Query Algorithms for Triangle Finding...

arxiv.org

From: Frederic Magniez [view email] [v1] Wed, 3 Oct :57:01 GMT (2805kb,D). Which authors of this paper are endorsers? Link back to: arXiv, form ...

Quantum Algorithms for the Triangle Problem : Frederic Magniez : Free...

archive.org

We present two new quantum algorithms that either find a triangle (a copy of $K_{3}$) in an undirected graph $G$ on $n$ nodes, or reject if $G$ is triangle free.

Wikipedia: Граф без треугольников — Википедия

В теории графов графом без треугольников называется неориентированный граф, Frederic Magniez, Miklos Santha, Mario Szegedy Quantum Algorithms for the Triangle Problem. — J. Mycielski Sur le coloriage des graphes ...