( en | de | ru )

 

Disambiguation of "Kulkarni, Raghav"

Author of the publication

copydeleteadd this publication to your clipboard
On the complexity of trial and error for constraint satisfaction problems.

, , , , and . Electron. Colloquium Comput. Complex., (2014)

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.

Jagadish Kulkarni

Raghav Bhaskar

Raghav Aras

Praveen Kulkarni

Suchita Kulkarni

 

Other publications of authors with the same name

Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees., , and . CSR, volume 8476 of Lecture Notes in Computer Science, page 97-110. Springer, (2014)On the Power of Isolation in Planar Structures.. Electron. Colloquium Comput. Complex., (2009)Improving Tug-of-War sketch using Control-Variates method., , and . ACDA, page 66-76. SIAM, (2021)Minwise-Independent Permutations with Insertion and Deletion of Features., and . SISAP, volume 14289 of Lecture Notes in Computer Science, page 171-184. Springer, (2023)Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive., , and . TAMC, volume 7876 of Lecture Notes in Computer Science, page 224-235. Springer, (2013)CrystalBall: Gazing in the Black Box of SAT Solving., , and . SAT, volume 11628 of Lecture Notes in Computer Science, page 371-387. Springer, (2019)A New NC-Algorithm for Finding a Perfect Matching in d-Regular Bipartite Graphs When d Is Small.. CIAC, volume 3998 of Lecture Notes in Computer Science, page 308-319. Springer, (2006)Quantum Query Complexity of Subgraph Isomorphism and Homomorphism., and . STACS, volume 47 of LIPIcs, page 48:1-48:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Any monotone property of 3-uniform hypergraphs is weakly evasive., , and . Theor. Comput. Sci., (2015)Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs., , , and . STACS, volume 9 of LIPIcs, page 579-590. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)