| Articolul precedent |
| Articolul urmator |
 |
 496 0 |
 SM ISO690:2012VEGA, Frank. Triangle Finding. In: Proceedings IMCS-55: The Fifth Conference of Mathematical Society of the Republic of Moldova, 28 septembrie - 1 octombrie 2019, Chișinău. Chișinău, Republica Moldova: "VALINEX" SRL, 2019, pp. 261-264. ISBN 978-9975-68-378-4. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Proceedings IMCS-55 2019 | ||||||
|
Conferința "Conference of Mathematical Society of the Republic of Moldova" Chișinău, Moldova, 28 septembrie - 1 octombrie 2019 | ||||||
|
||||||
| Pag. 261-264 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
If we assume that we can do the Binary AND Operation in constant time, then Triangle Finding can be solved in quadratic time. |
||||||
| Cuvinte-cheie algorithm, undirected graphs, lower bound, matrix |
||||||
|
|
|
|
