Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

89

Voted

ISAAC
2003
Springer

103views Algorithms» more ISAAC 2003»

Upper Bounds on the Complexity of Some Galois Theory Problems

15 years 8 months ago

Upper Bounds on the Complexity of Some Galois Theory Problems

Download www.cse.iitk.ac.in

Vikraman Arvind, Piyush P. Kurur

Real-time Traffic

ISAAC 2003 |

claim paper

Related Content

» Quantum Query Complexity of Some Graph Problems

» Ggraphs for the cage problem a new upper bound

» Complexity of Decision Problems for Simple Regular Expressions

» Quantum lower bound for the collision problem

» On the complexity of the resolvent representation of some prime differential ideals

» Monotone complexity and the rank of matrices

» New upper and lower bounds for randomized and quantum local search

» Tight Upper Bounds for Streett and Parity Complementation

» The communication complexity of the ExactN Problem revisited

Post Info
More Details (n/a)

Added	07 Jul 2010
Updated	07 Jul 2010
Type	Conference
Year	2003
Where	ISAAC
Authors	Vikraman Arvind, Piyush P. Kurur

Comments (0)