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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
119
Voted
MFCS
1995
Springer
86
views
Theoretical Computer Science
»
more
MFCS 1995
»
Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities
15 years 6 months ago
Download
math.uni-heidelberg.de
Let ≤r and ≤s be two binary relations on 2N which are meant as reducibilities. Let both relations be closed under finite variation (of their set arguments) and consider the un...
Wolfgang Merkle, Yongge Wang
claim paper
Read More »