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
1581
search results - page 317 / 317
»
Analysis of Computational Time of Simple Estimation of Distr...
Sort
relevance
views
votes
recent
update
View
thumb
title
36
click to vote
STOC
2012
ACM
196
views
Algorithms
»
more
STOC 2012
»
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
11 years 11 months ago
Download
www.princeton.edu
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
Paul Beame, Christopher Beck, Russell Impagliazzo
claim paper
Read More »
« Prev
« First
page 317 / 317
Last »
Next »