Subquadratic Algorithms for 3SUM

Author： Baran Ilya Demaine Erik Ptraşcu Mihai

ISSN： 0178-4617

Source： Algorithmica, Vol.50, Iss.4, 2008-04, pp. : 584-596

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces: Theoretical Advances in Data Clustering (Guest Editors: Nina Mishra and Rajeev Motwani)

By Borodin Allan

Machine Learning, Vol. 56, Iss. 1-3, 2004-07 ,pp. : 153-167

Springer Publishing Company

Access to resources Recommend Favorite

Recognizing median graphs in subquadratic time

By Hagauer J. Imrich W. Klavzar S.

Theoretical Computer Science, Vol. 215, Iss. 1, 1999-02 ,pp. : 123-136

Elsevier

Access to resources Recommend Favorite

A Comparative Study of the MAX and SUM Machine-Learning Algorithms using Virtual Fuzzy Sets

By K. C.C.

Engineering Applications of Artificial Intelligence, Vol. 9, Iss. 5, 1996-10 ,pp. : 515-522

Elsevier

Access to resources Recommend Favorite

O(log*n) algorithms on a Sum-CRCW PRAM

By Eisenstat S.

Computing, Vol. 79, Iss. 1, 2007-02 ,pp. : 93-97

Springer Publishing Company

Access to resources Recommend Favorite

Message Passing Algorithms for MLS-3LIN Problem

By Watanabe Osamu

Algorithmica, Vol. 66, Iss. 4, 2013-08 ,pp. : 848-868

Springer Publishing Company

Access to resources Recommend Favorite