The SCEAS System
| |||||||

## Search the dblp DataBase
Piyush P. Kurur:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Vikraman Arvind, Piyush P. Kurur
**On the Complexity of Computing Units in a Number Field.**[Citation Graph (0, 0)][DBLP] ANTS, 2004, pp:72-86 [Conf] - Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan
**Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2005, pp:13-27 [Conf] - Vikraman Arvind, Piyush P. Kurur
**Graph Isomorphism is in SPP.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:743-750 [Conf] - Vikraman Arvind, Piyush P. Kurur
**Upper Bounds on the Complexity of Some Galois Theory Problems.**[Citation Graph (0, 0)][DBLP] ISAAC, 2003, pp:716-725 [Conf] - Vikraman Arvind, Piyush P. Kurur
**A Polynomial Time Nilpotence Test for Galois Groups and Related Results.**[Citation Graph (0, 0)][DBLP] MFCS, 2006, pp:134-145 [Conf] - Vikraman Arvind, Piyush P. Kurur
**Graph Isomorphism is in SPP**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:037, pp:- [Journal] - Vikraman Arvind, Piyush P. Kurur
**Upper Bounds on the Complexity of some Galois Theory Problems**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:064, pp:- [Journal] - Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan
**Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy.**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:121, pp:- [Journal] - Vikraman Arvind, Piyush P. Kurur
**Graph Isomorphism is in SPP.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2006, v:204, n:5, pp:835-852 [Journal] - Vikraman Arvind, Piyush P. Kurur
**A Polynomial Time Nilpotence Test for Galois Groups and Related Results**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] **Can quantum search accelerate evolutionary algorithms?**[Citation Graph (, )][DBLP]**Representing Groups on Graphs.**[Citation Graph (, )][DBLP]**Fast integer multiplication using modular arithmetic.**[Citation Graph (, )][DBLP]**Fast Integer Multiplication using Modular Arithmetic**[Citation Graph (, )][DBLP]**Representating groups on graphs**[Citation Graph (, )][DBLP]**Quantum Cyclic Code**[Citation Graph (, )][DBLP]**Fast Integer Multiplication using Modular Arithmetic.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |