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
612
search results - page 2 / 123
»
Hardness assumptions in the foundations of theoretical compu...
Sort
relevance
views
votes
recent
update
View
thumb
title
18
click to vote
SOFSEM
2005
Springer
163
views
Theoretical Computer Science
»
more
SOFSEM 2005
»
Logical Foundations for Data Integration
13 years 11 months ago
Download
kedrigern.dcs.fmph.uniba.sk
Maurizio Lenzerini
claim paper
Read More »
12
click to vote
FOCS
2008
IEEE
105
views
Theoretical Computer Science
»
more
FOCS 2008
»
On Basing Lower-Bounds for Learning on Worst-Case Assumptions
13 years 12 months ago
Download
www.cs.princeton.edu
Benny Applebaum, Boaz Barak, David Xiao
claim paper
Read More »
11
click to vote
FOCS
2007
IEEE
118
views
Theoretical Computer Science
»
more
FOCS 2007
»
Hardness Amplification for Errorless Heuristics
13 years 9 months ago
Download
projectamericano.com
Andrej Bogdanov, Muli Safra
claim paper
Read More »
18
click to vote
ERSHOV
2001
Springer
132
views
Theoretical Computer Science
»
more
ERSHOV 2001
»
A Theoretical Foundation of Program Synthesis by Equivalent Transformation
13 years 10 months ago
Download
assam.cims.hokudai.ac.jp
Kiyoshi Akama, Hidekatsu Koike, Hiroshi Mabuchi
claim paper
Read More »
16
click to vote
FOCS
2009
IEEE
106
views
Theoretical Computer Science
»
more
FOCS 2009
»
2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
14 years 4 days ago
Download
userweb.cs.utexas.edu
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
Yael Tauman Kalai, Xin Li, Anup Rao
claim paper
Read More »
« Prev
« First
page 2 / 123
Last »
Next »