( en | de | ru )

 

Disambiguation of "Naik, Ashish V."

Author of the publication

copydeleteadd this publication to your clipboard
P-Selective Sets, and Reducing Search to Decision vs. Self-Reducability.

, , and . SCT, page 52-64. IEEE Computer Society, (1993)

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.

Roshan Naik

Ashish Shah

Azad Naik

Anu Naik

Ashish Shrivastava

 

Other publications of authors with the same name

A Hierarchy Based on Output Multiplicity., , , and . Theor. Comput. Sci., 207 (1): 131-157 (1998)Adaptive Versus Nonadaptive Queries to NP and p-Selective Sets., and . Comput. Complex., 8 (2): 169-187 (1999)On Quasilinear-Time Complexity Theory., , and . Theor. Comput. Sci., 148 (2): 325-349 (1995)Inverting onto functions., , , and . Inf. Comput., 186 (1): 90-103 (2003)Inverting Onto Functions., , , and . CCC, page 213-222. IEEE Computer Society, (1996)On Coherence, Random-Self-Reducibility, and Self-Correction., , , and . Comput. Complex., 7 (2): 174-191 (1998)On Coherence, Random-self-reducibility, and Self-correction., , , and . CCC, page 59-67. IEEE Computer Society, (1996)Computing Solutions Uniquely collapses the Polynomial Hierarchy., , , and . ISAAC, volume 834 of Lecture Notes in Computer Science, page 56-64. Springer, (1994)Quasilinear Time Complexity Theory., , and . STACS, volume 775 of Lecture Notes in Computer Science, page 97-108. Springer, (1994)On the Existence of Hard Sparse Sets under Weak Reductions., , and . STACS, volume 1046 of Lecture Notes in Computer Science, page 307-318. Springer, (1996)