×
Compute Distance To:
Author ID: arvind.vikraman Recent zbMATH articles by "Arvind, Vikraman"
Published as: Arvind, V.; Arvind, Vikraman
Homepage: https://www.imsc.res.in/~arvind/
External Links: MGP

Publications by Year

Citations contained in zbMATH Open

85 Publications have been cited 300 times in 231 Documents Cited by Year
Approximation algorithms for some parameterized counting problems. Zbl 1019.68135
Arvind, V.; Raman, Venkatesh
19
2002
Reductions to sets of low information content. Zbl 0794.68058
Arvind, V.; Han, Y.; Hemachandra, L.; Köbler, J.; Lozano, A.; Mundhenk, M.; Ogiwara, M.; Schöning, U.; Silvestri, R.; Thierauf, T.
17
1993
Graph Isomorphism is in SPP. Zbl 1110.68090
Arvind, V.; Kurur, Piyush P.
17
2006
Derandomizing the isolation lemma and lower bounds for circuit size. Zbl 1159.68634
Arvind, V.; Mukhopadhyay, Partha
12
2008
On computing the distinguishing numbers of planar graphs and beyond: a counting approach. Zbl 1226.05210
Arvind, V.; Cheng, Christine T.; Devanur, Nikhil R.
12
2008
On pseudorandomness and resource-bounded measure. Zbl 0974.68063
Arvind, V.; Köbler, J.
9
2001
Isomorphism testing: perspective and open problems. Zbl 1169.68440
Arvind, V.; Torán, Jacobo
8
2005
On the hardness of the noncommutative determinant. Zbl 1293.68156
Arvind, Vikraman; Srinivasan, Srikanth
7
2010
Quasi-linear truth-table reductions to \(p\)-selective sets. Zbl 0871.68082
Agrawal, M.; Arvind, V.
7
1996
On resource-bounded measure and pseudorandomness. Zbl 0889.03029
Arvind, V.; Köbler, J.
7
1997
Arithmetic circuits and the Hadamard product of polynomials. Zbl 1248.68209
Arvind, Vikraman; Joglekar, Pushkar S.; Srinivasan, Srikanth
7
2009
An \(O(n^ 2)\) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all Horn sentences. Zbl 0635.68108
Arvind, V.; Biswas, S.
6
1987
New results on noncommutative and commutative polynomial identity testing. Zbl 1225.68090
Arvind, V.; Mukhopadhyay, Partha; Srinivasan, Srikanth
6
2010
New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes. Zbl 1059.68043
Arvind, V.; Köbler, Johannes
6
2002
If NP has polynomial-size circuits, then MA=AM. Zbl 0874.68185
Arvind, Vikraman; Köbler, Johannes; Schöning, Uwe; Schuler, Rainer
6
1995
A logspace algorithm for partial 2-tree canonization. Zbl 1142.68368
Arvind, Vikraman; Das, Bireswar; Köbler, Johannes
6
2008
Graph isomorphism, color refinement, and compactness. Zbl 1379.05080
Arvind, V.; Köbler, Johannes; Rattan, Gaurav; Verbitsky, Oleg
6
2017
Some lower bound results for set-multilinear arithmetic computations. Zbl 1358.68109
Arvind, V.; Raja, S.
6
2016
On bounded truth-table, conjunctive, and randomized reductions to sparse sets. Zbl 0919.03034
Arvind, V.; Köbler, J.; Mundhenk, M.
5
1992
The ideal membership problem and polynomial identity testing. Zbl 1190.68027
Arvind, V.; Mukhopadhyay, Partha
5
2010
On hypergraph and graph isomorphism with bounded color classes. Zbl 1136.68446
Arvind, V.; Köbler, Johannes
5
2006
Solvable black-box group problems are low for PP. Zbl 0901.68072
Arvind, V.; Vinodchandran, N. V.
5
1997
Upper bounds for the complexity of sparse and tally descriptions. Zbl 0840.68041
Arvind, V.; Köbler, J.; Mundhenk, M.
4
1996
The quantum query complexity of 0-1 knapsack and associated claw problems. Zbl 1205.68157
Arvind, V.; Schuler, Rainer
4
2003
The space complexity of \(k\)-tree isomorphism. Zbl 1193.68124
Arvind, V.; Das, Bireswar; Köbler, Johannes
4
2007
Arithmetic complexity, Kleene closure, and formal power series. Zbl 1040.68043
Allender, Eric; Arvind, V.; Mahajan, Meena
4
2003
On Weisfeiler-Leman invariance: subgraph counts and related graph properties. Zbl 1450.05056
Arvind, V.; Fuhlbrück, Frank; Köbler, Johannes; Verbitsky, Oleg
4
2020
Graph isomorphism is low for ZPP(NP) and other lowness results. Zbl 0962.68072
Arvind, Vikraman; Köbler, Johannes
3
2000
Colored hypergraph isomorphism is fixed parameter tractable. Zbl 1308.68061
Arvind, V.; Das, Bireswar; Köbler, Johannes; Toda, Seinosuke
3
2015
Approximate graph isomorphism. Zbl 1365.68464
Arvind, Vikraman; Köbler, Johannes; Kuhnert, Sebastian; Vasudev, Yadu
3
2012
Some sieving algorithms for lattice problems. Zbl 1248.68231
Arvind, V.; Joglekar, Pushkar S.
3
2008
The monomial ideal membership problem and polynomial identity testing. Zbl 1193.68125
Arvind, V.; Mukhopadhyay, Partha
3
2007
A family of quantum stabilizer codes based on the Weyl commutation relations over a finite field. Zbl 1085.94025
Arvind, V.; Parthasarthy, K. R.
3
2003
Randomized polynomial time identity testing for noncommutative circuits. Zbl 1369.68347
Arvind, V.; Joglekar, Pushkar S; Mukhopadhyay, Partha; Raja, S.
3
2017
On the complexity of noncommutative polynomial factorization. Zbl 1401.68106
Arvind, V.; Rattan, Gaurav; Joglekar, Pushkar
3
2015
Lowness and the complexity of sparse and tally descriptions. Zbl 0925.68214
Arvind, V.; Koebler, J.; Mundhenk, M.
2
1992
Sparse sets, approximable sets, and parallel queries to NP. Zbl 0928.68053
Arvind, Vikraman; Torán, Jacobo
2
1999
Kernel constructible languages. Zbl 0532.68077
Arvind, V.; Biswas, S.
2
1983
On helping and interactive proof systems. Zbl 0830.68111
Arvind, V.; Köbler, J.; Schuler, R.
2
1995
Nondeterministic instance complexity and hard-to-prove tautologies. Zbl 0962.68154
Arvind, Vikraman; Köbler, Johannes; Mundhenk, Martin; Torán, Jacobo
2
2000
Isomorphism and canonization of tournaments and hypertournaments. Zbl 1231.05107
Arvind, V.; Das, Bireswar; Mukhopadhyay, Partha
2
2010
Parameterized complexity of small weight automorphisms. Zbl 1402.68080
Arvind, Vikraman; Köbler, Johannes; Kuhnert, Sebastian; Torán, Jacobo
2
2017
Solving linear equations parameterized by Hamming weight. Zbl 1350.68124
Arvind, V.; Köbler, Johannes; Kuhnert, Sebastian; Torán, Jacobo
2
2016
The complexity of bounded register and skew arithmetic computation. Zbl 1354.68104
Arvind, Vikraman; Raja, S.
2
2014
A nonadaptive NC checker for permutation group intersection. Zbl 0974.68022
Arvind, V.; Torán, J.
2
2001
Geometric sets of low information content. Zbl 0871.68114
Agrawal, M.; Arvind, V.
2
1996
A note on decision versus search for graph automorphism. Zbl 0876.68079
Agrawal, M.; Arvind, V.
2
1996
Colored hypergraph isomorphism is fixed parameter tractable. Zbl 1245.68098
Arvind, V.; Das, Bireswar; Köbler, Johannes; Toda, Seinosuke
2
2010
The complexity of solving linear equations over a finite ring. Zbl 1119.68094
Arvind, V.; Vijayaraghavan, T. C.
2
2005
The complexity of modular graph automorphism. Zbl 0969.68083
Arvind, V.; Beigel, R.; Lozano, A.
2
2000
SZK proofs for black-box group problems. Zbl 1148.68020
Arvind, V.; Das, Bireswar
2
2008
The orbit problem is in the GapL hierarchy. Zbl 1148.68384
Arvind, V.; Vijayaraghavan, T. C.
2
2008
The complexity of quasigroup isomorphism and the minimum generating set problem. Zbl 1135.68434
Arvind, V.; Torán, Jacobo
2
2006
On lower bounds for constant width arithmetic circuits. Zbl 1273.68144
Arvind, V.; Joglekar, Pushkar S.; Srinivasan, Srikanth
2
2009
On the Weisfeiler-Leman dimension of fractional packing. Zbl 1437.68134
Arvind, Vikraman; Fuhlbrück, Frank; Köbler, Johannes; Verbitsky, Oleg
2
2020
On Tinhofer’s linear programming approach to isomorphism testing. Zbl 1465.05116
Arvind, V.; Köbler, Johannes; Rattan, Gaurav; Verbitsky, Oleg
2
2015
Solvable group isomorphism is (almost) in \(\mathsf{NP} \cap \mathsf{coNP}\). Zbl 1322.68092
Arvind, Vikraman; Torán, Jacobo
2
2011
Hausdorff reductions to sparse sets and to sets of high information content. Zbl 0925.03184
Arvind, V.; Köbler, J.; Mundhenk, M.
1
1993
On certain bandwidth restricted versions of the satisfiability problem of propositional CNF formulas. Zbl 0634.03032
Arvind, V.; Biswas, S.
1
1987
On some bandwidth restricted versions of the satisfiability problem of propositional CNF formulas. Zbl 0687.03018
Arvind, V.; Biswas, S.
1
1989
Perspectives in computational complexity. The Somenath Biswas anniversary volume. Selected papers based on the presentations at the workshop, Kanpur, India, Summer 2012. Zbl 1294.68010
1
2014
The complexity of black-box ring problems. Zbl 1162.68455
Arvind, V.; Das, Bireswar; Mukhopadhyay, Partha
1
2006
Exact learning via teaching assistants. Zbl 0944.68155
Arvind, V.; Vinodchandran, N. V.
1
2000
The counting complexity of group-definable languages. Zbl 0944.68067
Arvind, V.; Vinodchandran, N. V.
1
2000
Parameterized learnability of juntas. Zbl 1194.68186
Arvind, V.; Köbler, Johannes; Lindner, Wolfgang
1
2009
Classifying problems on linear congruences and Abelian permutation groups using logspace counting classes. Zbl 1204.68096
Arvind, V.; Vijayaraghavan, T. C.
1
2010
The orbit problem is in the GapL hierarchy. Zbl 1298.65075
Arvind, V.; Vijayaraghavan, T. C.
1
2011
Uniform derandomization from pathetic lower bounds. Zbl 1328.68079
Allender, Eric; Arvind, V.; Santhanam, Rahul; Wang, Fengming
1
2012
On the hardness of the noncommutative determinant. Zbl 1390.68319
Arvind, V.; Srinivasan, Srikanth
1
2018
Isomorphism testing of Boolean functions computable by constant-depth circuits. Zbl 1310.94239
Arvind, V.; Vasudev, Yadu
1
2014
Canonizing hypergraphs under abelian group action. Zbl 1286.05162
Arvind, V.; Köbler, Johannes
1
2011
On helping and interactive proof systems. Zbl 0953.68554
Arvind, V.; Köbler, J.; Schuler, R.
1
1994
Erdős-Rényi sequences and deterministic construction of expanding Cayley graphs. Zbl 1297.68282
Arvind, Vikraman; Mukhopadhyay, Partha; Nimbhorkar, Prajakta
1
2012
The isomorphism problem for \(k\)-trees is complete for logspace. Zbl 1253.68161
Arvind, V.; Das, Bireswar; Köbler, Johannes; Kuhnert, Sebastian
1
2012
The remote point problem, small bias spaces, and expanding generator sets. Zbl 1230.68226
Arvind, Vikraman; Srinivasan, Srikanth
1
2010
Comments on “Arithmetic complexity, Kleene closure, and formal power series”. Zbl 1286.68164
Allender, Eric; Arvind, V.; Mahajan, Meena
1
2013
The complexity of exactly learning algebraic concepts. Zbl 1184.68279
Arvind, V.; Vinodchandran, N. V.
1
1996
On the complexity of computing units in a number field. Zbl 1148.11320
Arvind, V.; Kurur, Piyush P.
1
2004
Non-stabilizer quantum codes from Abelian subgroups of the error group. Zbl 1213.81048
Arvind, V.; Kurur, P. P.; Parthasarathy, K. R.
1
2004
On isomorphism and canonization of tournaments and hypertournaments. Zbl 1135.05304
Arvind, V.; Das, Bireswar; Mukhopadhyay, Partha
1
2006
On Weisfeiler-Leman invariance: subgraph counts and related graph properties. Zbl 07160830
Arvind, Vikraman; Fuhlbrück, Frank; Köbler, Johannes; Verbitsky, Oleg
1
2019
Efficient identity testing and polynomial factorization in nonassociative free rings. Zbl 1441.68299
Arvind, Vikraman; Datta, Rajit; Mukhopadhyay, Partha; Raja, S.
1
2017
Finding small weight isomorphisms with additional constraints is fixed-parameter tractable. Zbl 1443.68118
Arvind, Vikraman; Köbler, Johannes; Kuhnert, Sebastian; Torán, Jacobo
1
2018
On the power of color refinement. Zbl 1436.05101
Arvind, V.; Köbler, Johannes; Rattan, Gaurav; Verbitsky, Oleg
1
2015
Reductions to sets of low information content (extended abstract). Zbl 1425.68125
Arvind, V.; Han, Y.; Hemachandra, L.; Köbler, J.; Lozano, A.; Mundhenk, M.; Ogiwara, M.; Schöning, U.; Silvestri, R.; Thierauf, T.
1
1992
On Weisfeiler-Leman invariance: subgraph counts and related graph properties. Zbl 1450.05056
Arvind, V.; Fuhlbrück, Frank; Köbler, Johannes; Verbitsky, Oleg
4
2020
On the Weisfeiler-Leman dimension of fractional packing. Zbl 1437.68134
Arvind, Vikraman; Fuhlbrück, Frank; Köbler, Johannes; Verbitsky, Oleg
2
2020
On Weisfeiler-Leman invariance: subgraph counts and related graph properties. Zbl 07160830
Arvind, Vikraman; Fuhlbrück, Frank; Köbler, Johannes; Verbitsky, Oleg
1
2019
On the hardness of the noncommutative determinant. Zbl 1390.68319
Arvind, V.; Srinivasan, Srikanth
1
2018
Finding small weight isomorphisms with additional constraints is fixed-parameter tractable. Zbl 1443.68118
Arvind, Vikraman; Köbler, Johannes; Kuhnert, Sebastian; Torán, Jacobo
1
2018
Graph isomorphism, color refinement, and compactness. Zbl 1379.05080
Arvind, V.; Köbler, Johannes; Rattan, Gaurav; Verbitsky, Oleg
6
2017
Randomized polynomial time identity testing for noncommutative circuits. Zbl 1369.68347
Arvind, V.; Joglekar, Pushkar S; Mukhopadhyay, Partha; Raja, S.
3
2017
Parameterized complexity of small weight automorphisms. Zbl 1402.68080
Arvind, Vikraman; Köbler, Johannes; Kuhnert, Sebastian; Torán, Jacobo
2
2017
Efficient identity testing and polynomial factorization in nonassociative free rings. Zbl 1441.68299
Arvind, Vikraman; Datta, Rajit; Mukhopadhyay, Partha; Raja, S.
1
2017
Some lower bound results for set-multilinear arithmetic computations. Zbl 1358.68109
Arvind, V.; Raja, S.
6
2016
Solving linear equations parameterized by Hamming weight. Zbl 1350.68124
Arvind, V.; Köbler, Johannes; Kuhnert, Sebastian; Torán, Jacobo
2
2016
Colored hypergraph isomorphism is fixed parameter tractable. Zbl 1308.68061
Arvind, V.; Das, Bireswar; Köbler, Johannes; Toda, Seinosuke
3
2015
On the complexity of noncommutative polynomial factorization. Zbl 1401.68106
Arvind, V.; Rattan, Gaurav; Joglekar, Pushkar
3
2015
On Tinhofer’s linear programming approach to isomorphism testing. Zbl 1465.05116
Arvind, V.; Köbler, Johannes; Rattan, Gaurav; Verbitsky, Oleg
2
2015
On the power of color refinement. Zbl 1436.05101
Arvind, V.; Köbler, Johannes; Rattan, Gaurav; Verbitsky, Oleg
1
2015
The complexity of bounded register and skew arithmetic computation. Zbl 1354.68104
Arvind, Vikraman; Raja, S.
2
2014
Perspectives in computational complexity. The Somenath Biswas anniversary volume. Selected papers based on the presentations at the workshop, Kanpur, India, Summer 2012. Zbl 1294.68010
1
2014
Isomorphism testing of Boolean functions computable by constant-depth circuits. Zbl 1310.94239
Arvind, V.; Vasudev, Yadu
1
2014
Comments on “Arithmetic complexity, Kleene closure, and formal power series”. Zbl 1286.68164
Allender, Eric; Arvind, V.; Mahajan, Meena
1
2013
Approximate graph isomorphism. Zbl 1365.68464
Arvind, Vikraman; Köbler, Johannes; Kuhnert, Sebastian; Vasudev, Yadu
3
2012
Uniform derandomization from pathetic lower bounds. Zbl 1328.68079
Allender, Eric; Arvind, V.; Santhanam, Rahul; Wang, Fengming
1
2012
Erdős-Rényi sequences and deterministic construction of expanding Cayley graphs. Zbl 1297.68282
Arvind, Vikraman; Mukhopadhyay, Partha; Nimbhorkar, Prajakta
1
2012
The isomorphism problem for \(k\)-trees is complete for logspace. Zbl 1253.68161
Arvind, V.; Das, Bireswar; Köbler, Johannes; Kuhnert, Sebastian
1
2012
Solvable group isomorphism is (almost) in \(\mathsf{NP} \cap \mathsf{coNP}\). Zbl 1322.68092
Arvind, Vikraman; Torán, Jacobo
2
2011
The orbit problem is in the GapL hierarchy. Zbl 1298.65075
Arvind, V.; Vijayaraghavan, T. C.
1
2011
Canonizing hypergraphs under abelian group action. Zbl 1286.05162
Arvind, V.; Köbler, Johannes
1
2011
On the hardness of the noncommutative determinant. Zbl 1293.68156
Arvind, Vikraman; Srinivasan, Srikanth
7
2010
New results on noncommutative and commutative polynomial identity testing. Zbl 1225.68090
Arvind, V.; Mukhopadhyay, Partha; Srinivasan, Srikanth
6
2010
The ideal membership problem and polynomial identity testing. Zbl 1190.68027
Arvind, V.; Mukhopadhyay, Partha
5
2010
Isomorphism and canonization of tournaments and hypertournaments. Zbl 1231.05107
Arvind, V.; Das, Bireswar; Mukhopadhyay, Partha
2
2010
Colored hypergraph isomorphism is fixed parameter tractable. Zbl 1245.68098
Arvind, V.; Das, Bireswar; Köbler, Johannes; Toda, Seinosuke
2
2010
Classifying problems on linear congruences and Abelian permutation groups using logspace counting classes. Zbl 1204.68096
Arvind, V.; Vijayaraghavan, T. C.
1
2010
The remote point problem, small bias spaces, and expanding generator sets. Zbl 1230.68226
Arvind, Vikraman; Srinivasan, Srikanth
1
2010
Arithmetic circuits and the Hadamard product of polynomials. Zbl 1248.68209
Arvind, Vikraman; Joglekar, Pushkar S.; Srinivasan, Srikanth
7
2009
On lower bounds for constant width arithmetic circuits. Zbl 1273.68144
Arvind, V.; Joglekar, Pushkar S.; Srinivasan, Srikanth
2
2009
Parameterized learnability of juntas. Zbl 1194.68186
Arvind, V.; Köbler, Johannes; Lindner, Wolfgang
1
2009
Derandomizing the isolation lemma and lower bounds for circuit size. Zbl 1159.68634
Arvind, V.; Mukhopadhyay, Partha
12
2008
On computing the distinguishing numbers of planar graphs and beyond: a counting approach. Zbl 1226.05210
Arvind, V.; Cheng, Christine T.; Devanur, Nikhil R.
12
2008
A logspace algorithm for partial 2-tree canonization. Zbl 1142.68368
Arvind, Vikraman; Das, Bireswar; Köbler, Johannes
6
2008
Some sieving algorithms for lattice problems. Zbl 1248.68231
Arvind, V.; Joglekar, Pushkar S.
3
2008
SZK proofs for black-box group problems. Zbl 1148.68020
Arvind, V.; Das, Bireswar
2
2008
The orbit problem is in the GapL hierarchy. Zbl 1148.68384
Arvind, V.; Vijayaraghavan, T. C.
2
2008
The space complexity of \(k\)-tree isomorphism. Zbl 1193.68124
Arvind, V.; Das, Bireswar; Köbler, Johannes
4
2007
The monomial ideal membership problem and polynomial identity testing. Zbl 1193.68125
Arvind, V.; Mukhopadhyay, Partha
3
2007
Graph Isomorphism is in SPP. Zbl 1110.68090
Arvind, V.; Kurur, Piyush P.
17
2006
On hypergraph and graph isomorphism with bounded color classes. Zbl 1136.68446
Arvind, V.; Köbler, Johannes
5
2006
The complexity of quasigroup isomorphism and the minimum generating set problem. Zbl 1135.68434
Arvind, V.; Torán, Jacobo
2
2006
The complexity of black-box ring problems. Zbl 1162.68455
Arvind, V.; Das, Bireswar; Mukhopadhyay, Partha
1
2006
On isomorphism and canonization of tournaments and hypertournaments. Zbl 1135.05304
Arvind, V.; Das, Bireswar; Mukhopadhyay, Partha
1
2006
Isomorphism testing: perspective and open problems. Zbl 1169.68440
Arvind, V.; Torán, Jacobo
8
2005
The complexity of solving linear equations over a finite ring. Zbl 1119.68094
Arvind, V.; Vijayaraghavan, T. C.
2
2005
On the complexity of computing units in a number field. Zbl 1148.11320
Arvind, V.; Kurur, Piyush P.
1
2004
Non-stabilizer quantum codes from Abelian subgroups of the error group. Zbl 1213.81048
Arvind, V.; Kurur, P. P.; Parthasarathy, K. R.
1
2004
The quantum query complexity of 0-1 knapsack and associated claw problems. Zbl 1205.68157
Arvind, V.; Schuler, Rainer
4
2003
Arithmetic complexity, Kleene closure, and formal power series. Zbl 1040.68043
Allender, Eric; Arvind, V.; Mahajan, Meena
4
2003
A family of quantum stabilizer codes based on the Weyl commutation relations over a finite field. Zbl 1085.94025
Arvind, V.; Parthasarthy, K. R.
3
2003
Approximation algorithms for some parameterized counting problems. Zbl 1019.68135
Arvind, V.; Raman, Venkatesh
19
2002
New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes. Zbl 1059.68043
Arvind, V.; Köbler, Johannes
6
2002
On pseudorandomness and resource-bounded measure. Zbl 0974.68063
Arvind, V.; Köbler, J.
9
2001
A nonadaptive NC checker for permutation group intersection. Zbl 0974.68022
Arvind, V.; Torán, J.
2
2001
Graph isomorphism is low for ZPP(NP) and other lowness results. Zbl 0962.68072
Arvind, Vikraman; Köbler, Johannes
3
2000
Nondeterministic instance complexity and hard-to-prove tautologies. Zbl 0962.68154
Arvind, Vikraman; Köbler, Johannes; Mundhenk, Martin; Torán, Jacobo
2
2000
The complexity of modular graph automorphism. Zbl 0969.68083
Arvind, V.; Beigel, R.; Lozano, A.
2
2000
Exact learning via teaching assistants. Zbl 0944.68155
Arvind, V.; Vinodchandran, N. V.
1
2000
The counting complexity of group-definable languages. Zbl 0944.68067
Arvind, V.; Vinodchandran, N. V.
1
2000
Sparse sets, approximable sets, and parallel queries to NP. Zbl 0928.68053
Arvind, Vikraman; Torán, Jacobo
2
1999
On resource-bounded measure and pseudorandomness. Zbl 0889.03029
Arvind, V.; Köbler, J.
7
1997
Solvable black-box group problems are low for PP. Zbl 0901.68072
Arvind, V.; Vinodchandran, N. V.
5
1997
Quasi-linear truth-table reductions to \(p\)-selective sets. Zbl 0871.68082
Agrawal, M.; Arvind, V.
7
1996
Upper bounds for the complexity of sparse and tally descriptions. Zbl 0840.68041
Arvind, V.; Köbler, J.; Mundhenk, M.
4
1996
Geometric sets of low information content. Zbl 0871.68114
Agrawal, M.; Arvind, V.
2
1996
A note on decision versus search for graph automorphism. Zbl 0876.68079
Agrawal, M.; Arvind, V.
2
1996
The complexity of exactly learning algebraic concepts. Zbl 1184.68279
Arvind, V.; Vinodchandran, N. V.
1
1996
If NP has polynomial-size circuits, then MA=AM. Zbl 0874.68185
Arvind, Vikraman; Köbler, Johannes; Schöning, Uwe; Schuler, Rainer
6
1995
On helping and interactive proof systems. Zbl 0830.68111
Arvind, V.; Köbler, J.; Schuler, R.
2
1995
On helping and interactive proof systems. Zbl 0953.68554
Arvind, V.; Köbler, J.; Schuler, R.
1
1994
Reductions to sets of low information content. Zbl 0794.68058
Arvind, V.; Han, Y.; Hemachandra, L.; Köbler, J.; Lozano, A.; Mundhenk, M.; Ogiwara, M.; Schöning, U.; Silvestri, R.; Thierauf, T.
17
1993
Hausdorff reductions to sparse sets and to sets of high information content. Zbl 0925.03184
Arvind, V.; Köbler, J.; Mundhenk, M.
1
1993
On bounded truth-table, conjunctive, and randomized reductions to sparse sets. Zbl 0919.03034
Arvind, V.; Köbler, J.; Mundhenk, M.
5
1992
Lowness and the complexity of sparse and tally descriptions. Zbl 0925.68214
Arvind, V.; Koebler, J.; Mundhenk, M.
2
1992
Reductions to sets of low information content (extended abstract). Zbl 1425.68125
Arvind, V.; Han, Y.; Hemachandra, L.; Köbler, J.; Lozano, A.; Mundhenk, M.; Ogiwara, M.; Schöning, U.; Silvestri, R.; Thierauf, T.
1
1992
On some bandwidth restricted versions of the satisfiability problem of propositional CNF formulas. Zbl 0687.03018
Arvind, V.; Biswas, S.
1
1989
An \(O(n^ 2)\) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all Horn sentences. Zbl 0635.68108
Arvind, V.; Biswas, S.
6
1987
On certain bandwidth restricted versions of the satisfiability problem of propositional CNF formulas. Zbl 0634.03032
Arvind, V.; Biswas, S.
1
1987
Kernel constructible languages. Zbl 0532.68077
Arvind, V.; Biswas, S.
2
1983
all top 5

Cited by 313 Authors

28 Arvind, Vikraman
19 Köbler, Johannes
8 Das, Bireswar
8 Vinodchandran, N. Variyam
7 Mukhopadhyay, Partha
7 Raghavendra Rao, B. V.
6 Hemaspaandra, Lane A.
5 Allender, Eric W.
5 Kuhnert, Sebastian
5 Mahajan, Meena
5 Sarma M. N., Jayalal
5 Shpilka, Amir
5 Thierauf, Thomas
5 Toda, Seinosuke
5 van Melkebeek, Dieter
5 Verbitsky, Oleg
4 Beigel, Richard
4 Cai, Jin-Yi
4 Fenner, Stephen A.
4 Fuhlbrück, Frank
4 Hitchcock, John M.
4 Meeks, Kitty
4 Rattan, Gaurav
3 Andrés Montoya, Juan
3 Curticapean, Radu
3 Datta, Rajit
3 Dell, Holger
3 Fortnow, Lance J.
3 Lagarde, Guillaume
3 Limaye, Nutan
3 Liu, Yunlong
3 Mundhenk, Martin
3 Ogihara, Mitsunori
3 Pavan, Aduri
3 Ponomarenko, Ilya Nikolaevich
3 Ryabov, Grigoriĭ Konstantinovich
3 Seto, Kazuhisa
3 Srinivasan, Srikanth
3 Torán, Jacobo
3 Volkovich, Ilya
3 Wang, Jianxin
3 Wenger, Paul Shannahan
2 Alikhani, Saeid
2 Balcázar, José Luis
2 Beyersdorff, Olaf
2 Chakaravarthy, Venkatesan T.
2 Chatterjee, Abhranil
2 Cucker, Felipe
2 Dadush, Daniel
2 Datta, Samir
2 Dvořák, Pavel
2 Engels, Christian
2 Ferrara, Michael J.
2 Fomin, Fedor V.
2 Gasarch, William Ian
2 Ghosal, Purnata
2 Goldberg, Leslie Ann
2 Grochow, Joshua A.
2 Gurjar, Rohit
2 Jerrum, Mark R.
2 Joglekar, Pushkar S.
2 Kawachi, Akinori
2 Kosovskaya, Tat’yana Matveevna
2 Krebs, Andreas
2 Kurur, Piyush P.
2 Lapinskas, John
2 Manthey, Bodo
2 Meslem, Kahina
2 Moser, Philippe
2 Müller, Sebastian
2 Nagao, Atsuki
2 Nagoya, Takayuki
2 Nimbhorkar, Prajakta
2 Qiao, Youming
2 Roy, Sambuddha
2 Sengupta, Samik
2 Sharma, Shivdutt
2 Soltani, Samaneh
2 Sopena, Éric
2 Tantau, Till
2 Teruyama, Junichi
2 Tewari, Raghunath
2 Thilikos, Dimitrios M.
2 Tripathi, Rahul
2 Tzameret, Iddo
2 Vadhan, Salil P.
2 Valla, Tomáš
2 Vasudev, Yadu
2 Wagner, Fabian
2 Watanabe, Osamu
2 Wigderson, Avi
2 Zhang, Yong
1 Abramsky, Samson
1 Agrawal, Manindra
1 Alon, Noga M.
1 Amir, Amihood
1 Amouzegar, Tayyebeh
1 Auddy, Arnab
1 Aurora, Pawan Kumar
1 Aydinlioǧlu, Bariş
...and 213 more Authors
all top 5

Cited in 58 Serials

24 Theoretical Computer Science
18 Journal of Computer and System Sciences
17 Information and Computation
17 Computational Complexity
15 Algorithmica
15 Theory of Computing Systems
11 Information Processing Letters
10 Discrete Applied Mathematics
5 Discrete Mathematics
4 SIAM Journal on Computing
4 International Journal of Foundations of Computer Science
3 SIAM Journal on Discrete Mathematics
2 Mathematical Systems Theory
2 European Journal of Combinatorics
2 Annals of Pure and Applied Logic
2 Graphs and Combinatorics
2 Journal of Symbolic Computation
2 Journal of the American Mathematical Society
2 RAIRO. Informatique Théorique et Applications
2 Vestnik St. Petersburg University. Mathematics
2 Discussiones Mathematicae. Graph Theory
2 Journal of Combinatorial Optimization
2 Theory of Computing
2 Computer Science Review
2 ACM Transactions on Computation Theory
1 Classical and Quantum Gravity
1 International Journal of Theoretical Physics
1 Journal of Mathematical Biology
1 Physics Letters. A
1 Reviews in Mathematical Physics
1 Advances in Mathematics
1 Computing
1 Information Sciences
1 Journal of Algebra
1 Journal of Applied Probability
1 Journal of Combinatorial Theory. Series A
1 Semigroup Forum
1 Combinatorica
1 Journal of Cryptology
1 Journal of the Ramanujan Mathematical Society
1 International Journal of Algebra and Computation
1 Linear Algebra and its Applications
1 Journal of Mathematical Sciences (New York)
1 Mathematical Logic Quarterly (MLQ)
1 The Electronic Journal of Combinatorics
1 Bulletin des Sciences Mathématiques
1 Annals of Mathematics and Artificial Intelligence
1 Izvestiya: Mathematics
1 Infinite Dimensional Analysis, Quantum Probability and Related Topics
1 Philosophical Transactions of the Royal Society of London. Series A. Mathematical, Physical and Engineering Sciences
1 Fundamenta Informaticae
1 Discrete Mathematics, Algorithms and Applications
1 Cryptography and Communications
1 Mathematical Programming Computation
1 Science China. Mathematics
1 RAIRO. Theoretical Informatics and Applications
1 ACM Transactions on Algorithms
1 Matematicheskie Voprosy Kriptografii

Citations by Year