Arvind, V. Constructivizing membership proofs in complexity classes. (English) Zbl 0892.68044 Int. J. Found. Comput. Sci. 8, No. 4, 433-442 (1997). MSC: 68Q15 PDFBibTeX XMLCite \textit{V. Arvind}, Int. J. Found. Comput. Sci. 8, No. 4, 433--442 (1997; Zbl 0892.68044) Full Text: DOI
Arvind, V.; Köbler, J.; Schuler, R. On helping and interactive proof systems. (English) Zbl 0830.68111 Int. J. Found. Comput. Sci. 6, No. 2, 137-153 (1995). MSC: 68T15 PDFBibTeX XMLCite \textit{V. Arvind} et al., Int. J. Found. Comput. Sci. 6, No. 2, 137--153 (1995; Zbl 0830.68111) Full Text: DOI
Arvind, V.; Biswas, S. [Thanh Tung Nguyen] Edge-deletion graph problems with first-order expressible subgraph properties. (English) Zbl 0753.05066 Int. J. Found. Comput. Sci. 2, No. 2, 83-99 (1991). MSC: 05C99 68Q25 05C85 03B10 05C45 PDFBibTeX XMLCite \textit{V. Arvind} and \textit{S. Biswas}, Int. J. Found. Comput. Sci. 2, No. 2, 83--99 (1991; Zbl 0753.05066) Full Text: DOI