( en | de | ru )

 

Disambiguation of "Kannan, Ravi"

Author of the publication

copydeleteadd this publication to your clipboard
A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search.

, , , , , , , and . Theor. Comput. Sci., 289 (1): 69-83 (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Karuppaiah Kannan

Ravi Walli

Srinivasaraghavan Kannan

Somasundar Kannan

Mylapore Ravi

 

Other publications of authors with the same name

Markets with Production: A Polynomial Time Algorithm and a Reduction to Pure Exchange., and . EC, page 733-749. ACM, (2015)Finding Dense Subgraphs in G(n, 1/2)., , and . WAOA, volume 5893 of Lecture Notes in Computer Science, page 98-103. Springer, (2009)A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies, , and . STOC, page 375-381. ACM, (1989)Principal Component Analysis and Higher Correlations for Distributed Data., , and . COLT, volume 35 of JMLR Workshop and Conference Proceedings, page 1040-1057. JMLR.org, (2014)The Shapes of Polyhedra., , and . Math. Oper. Res., 15 (2): 364-380 (1990)Pass efficient algorithms for approximating large matrices., and . SODA, page 223-232. ACM/SIAM, (2003)Test Sets for Integer Programs, 0_ Sentences.. Polyhedral Combinatorics, volume 1 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 39-48. DIMACS/AMS, (1990)Random sampling and approximation of MAX-CSPs., , , and . J. Comput. Syst. Sci., 67 (2): 212-243 (2003)On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines., , and . J. Comput. Syst. Sci., 38 (1): 134-149 (1989)Random Sampling and Approximation of MAX-CSP Problems, , , and . Electron. Colloquium Comput. Complex., (2001)