( en | de | ru )

 

Disambiguation of "Pavan, Aduri"

Author of the publication

copydeleteadd this publication to your clipboard
Separation of NP-Completeness Notions.

, and . CCC, page 78-89. IEEE Computer Society, (2001)

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.

Pavan Kumar

Chiara Pavan

G Pavan Kumar Reddy

Pavan Kumar

Pavan Ramkumar

 

Other publications of authors with the same name

Robustness of PSPACE-complete sets., and . Inf. Process. Lett., 103 (3): 102-104 (2007)On Pseudodeterministic Approximation Algorithms., , and . MFCS, volume 117 of LIPIcs, page 61:1-61:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Model Counting Meets Distinct Elements in a Data Stream., , , and . SIGMOD Rec., 51 (1): 87-94 (2022)Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy., , , and . Theor. Comput. Sci., 385 (1-3): 167-178 (2007)Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws, , , , and . Electron. Colloquium Comput. Complex., (2005)Bi-immunity separates strong NP-completeness notions., and . Inf. Comput., 188 (1): 116-126 (2004)On the Hardness of Permanent., , and . STACS, volume 1563 of Lecture Notes in Computer Science, page 90-99. Springer, (1999)Length-Increasing Reductions for PSPACE-Completeness., and . MFCS, volume 8087 of Lecture Notes in Computer Science, page 540-550. Springer, (2013)Strong Reductions and Isomorphism of Complete Sets., , and . Comput., 3 (2): 91-104 (2014)On Higher Arthur-Merlin Classes., , , and . Int. J. Found. Comput. Sci., 15 (1): 3-19 (2004)