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
34
click to vote
JCSS
2011
favorite
Email
discuss
report
107
views
more
JCSS 2011
»
The isomorphism conjecture for constant depth reductions
13 years 3 months ago
Download
www.cse.iitk.ac.in
For any class C closed under TC0 reductions, and for any measure u of uniformity containing Dlogtime, it is shown that all sets complete for C under u-uniform AC0 reductions are isomorphic under u-uniform AC0 -computable isomorphisms.
Manindra Agrawal
Real-time Traffic
-computable Isomorphisms
|
Isomorphic
|
JCSS 2011
|
U-uniform Ac0 Reductions
|
claim paper
Related Content
»
Data Dependent Circuit Design A Case Study
more »
Post Info
More Details (n/a)
Added
14 May 2011
Updated
14 May 2011
Type
Journal
Year
2011
Where
JCSS
Authors
Manindra Agrawal
Comments
(0)
Researcher Info
JCSS 2008 Study Group
Computer Vision