AAAAAA
Results:
1-9
|
Results: 9
Authors:
SIRCAR P
ARVIND V
Citation: P. Sircar et V. Arvind, NUMERICAL-ANALYSIS OF OPTICAL FIBERS WITH ARBITRARY REFRACTIVE-INDEX PROFILE, Journal of electromagnetic waves and applications, 11(9), 1997, pp. 1213-1227
Authors:
ARVIND V
VINODCHANDRAN NV
Citation: V. Arvind et Nv. Vinodchandran, SOLVABLE BLACK-BOX GROUP PROBLEMS ARE LOW FOR PP, Theoretical computer science, 180(1-2), 1997, pp. 17-45
Authors:
ARVIND V
KOBLER J
MUNDHENK M
Citation: V. Arvind et al., MONOTONOUS AND RANDOMIZED REDUCTIONS TO SPARSE SETS, Informatique theorique et applications, 30(2), 1996, pp. 155-179
Authors:
AGRAWAL M
ARVIND V
Citation: M. Agrawal et V. Arvind, A NOTE ON DECISION VERSUS SEARCH FOR GRAPH AUTOMORPHISM, Information and computation, 131(2), 1996, pp. 179-189
Authors:
AGRAWAL M
ARVIND V
Citation: M. Agrawal et V. Arvind, GEOMETRIC SETS OF LOW INFORMATION-CONTENT, Theoretical computer science, 158(1-2), 1996, pp. 193-219
Authors:
AGRAWAL M
ARVIND V
Citation: M. Agrawal et V. Arvind, QUASI-LINEAR TRUTH-TABLE REDUCTIONS TO P-SELECTIVE SETS, Theoretical computer science, 158(1-2), 1996, pp. 361-370
Authors:
ARVIND V
KOBLER J
MUNDHENK M
Citation: V. Arvind et al., UPPER-BOUNDS FOR THE COMPLEXITY OF SPARSE AND TALLY DESCRIPTIONS, Mathematical systems theory, 29(1), 1996, pp. 63-94
Authors:
ARVIND V
KOBLER J
SCHONING U
SCHULER R
Citation: V. Arvind et al., IF NP HAS POLYNOMIAL-SIZE CIRCUITS, THEN MA=AM, Theoretical computer science, 137(2), 1995, pp. 279-282
Authors:
ARVIND V
KOBLER J
MUNDHENK M
Citation: V. Arvind et al., ON REDUCTIONS TO SETS THAT AVOID EXPSPACE, Information processing letters, 56(2), 1995, pp. 109-114
Risultati:
1-9
|