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
2
search results - page 1 / 1
»
On the Power of Randomized Reductions and the Checkability o...
Sort
relevance
views
votes
recent
update
View
thumb
title
27
click to vote
COCO
2010
Springer
125
views
Algorithms
»
more
COCO 2010
»
On the Power of Randomized Reductions and the Checkability of SAT
14 years 13 days ago
Download
www.cs.princeton.edu
Mohammad Mahmoody, David Xiao
claim paper
Read More »
26
click to vote
FSTTCS
1992
Springer
98
views
Software Engineering
»
more
FSTTCS 1992
»
On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets
14 years 18 days ago
Download
vts.uni-ulm.de
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondetermini...
Vikraman Arvind, Johannes Köbler, Martin Mund...
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »