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
24
search results - page 2 / 5
»
focs 1990
Sort
relevance
views
votes
recent
update
View
thumb
title
20
click to vote
FOCS
1990
IEEE
90
views
Theoretical Computer Science
»
more
FOCS 1990
»
Decision Problems for Propositional Linear Logic
14 years 17 days ago
Download
www.csl.sri.com
Patrick Lincoln, John C. Mitchell, Andre Scedrov, ...
claim paper
Read More »
22
click to vote
FOCS
1990
IEEE
74
views
Theoretical Computer Science
»
more
FOCS 1990
»
Time-Space Tradeoffs for Undirected Graph Traversal
14 years 17 days ago
Download
www.cs.washington.edu
Paul Beame, Allan Borodin, Prabhakar Raghavan, Wal...
claim paper
Read More »
25
click to vote
FOCS
1990
IEEE
63
views
Theoretical Computer Science
»
more
FOCS 1990
»
Security Preserving Amplification of Hardness
14 years 17 days ago
Download
www.busim.ee.boun.edu.tr
Oded Goldreich, Russell Impagliazzo, Leonid A. Lev...
claim paper
Read More »
26
click to vote
FOCS
1990
IEEE
78
views
Theoretical Computer Science
»
more
FOCS 1990
»
Matrix Decomposition Problem Is Complete for the Average Case
14 years 17 days ago
Download
research.microsoft.com
The first algebraic average-case complete problem is presented. It is arguably the simplest natural average-case complete problem to date.
Yuri Gurevich
claim paper
Read More »
30
click to vote
FOCS
1990
IEEE
117
views
Theoretical Computer Science
»
more
FOCS 1990
»
The Lattice Reduction Algorithm of Gauss: An Average Case Analysis
14 years 17 days ago
Download
www.csie.nuk.edu.tw
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.
Brigitte Vallée, Philippe Flajolet
claim paper
Read More »
« Prev
« First
page 2 / 5
Last »
Next »