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
42
click to vote
FSTTCS
2001
Springer
favorite
Email
discuss
report
135
views
Software Engineering
»
more
FSTTCS 2001
»
The First-Order Isomorphism Theorem
14 years 4 months ago
Download
www.cs.umass.edu
For any class C und closed under NC1 reductions, it is shown that all sets complete for C under first-order (equivalently, Dlogtimeuniform AC0 ) reductions are isomorphic under first-order computable isomorphisms.
Manindra Agrawal
Real-time Traffic
Closed Under
|
FSTTCS 2001
|
Reductions
|
Software Engineering
|
first-order Computable Isomorphisms
|
claim paper
Post Info
More Details (n/a)
Added
28 Jul 2010
Updated
28 Jul 2010
Type
Conference
Year
2001
Where
FSTTCS
Authors
Manindra Agrawal
Comments
(0)
Researcher Info
Software Engineering Study Group
Computer Vision