Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
8
click to vote
STACS
2005
Springer
favorite
Email
discuss
report
110
views
Theoretical Computer Science
»
more
STACS 2005
»
Automorphisms of Finite Rings and Applications to Complexity of Problems
13 years 10 months ago
Download
www.cse.iitk.ac.in
Manindra Agrawal, Nitin Saxena
Real-time Traffic
STACS 2005
|
Theoretical Computer Science
|
claim paper
Related Content
»
Complexity of Ring Morphism Problems
»
The Complexity of BlackBox Ring Problems
»
Combinatorics with definable sets Euler characteristics and Grothendieck rings
»
Cryptographic Applications of Sparse Polynomials over Finite Rings
»
Selfdeployment Algorithms for Mobile Sensors on a Ring
»
Trading GRH for algebra algorithms for factoring polynomials and related structures
»
RingLWE in Polynomial Rings
»
Simplicial Perturbation Techniques and Effective Homology
»
Sharp Quantum versus Classical Query Complexity Separations
more »
Post Info
More Details (n/a)
Added
28 Jun 2010
Updated
28 Jun 2010
Type
Conference
Year
2005
Where
STACS
Authors
Manindra Agrawal, Nitin Saxena
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision