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
18306
search results - page 2 / 3662
»
Algorithmics in Exponential Time
Sort
relevance
views
votes
recent
update
View
thumb
title
11
click to vote
ICALP
2004
Springer
91
views
Programming Languages
»
more
ICALP 2004
»
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas
13 years 10 months ago
Download
publications.ias.edu
Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsy...
claim paper
Read More »
10
click to vote
CATS
2007
94
views
Applied Computing
»
more
CATS 2007
»
Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes
13 years 6 months ago
Download
crpit.com
Heidi Gebauer, Yoshio Okamoto
claim paper
Read More »
11
click to vote
CORR
2007
Springer
85
views
Education
»
more
CORR 2007
»
Polynomial time algorithms to approximate mixed volumes within a simply exponential factor
13 years 5 months ago
Download
www.optimization-online.org
Leonid Gurvits
claim paper
Read More »
12
click to vote
STOC
2000
ACM
95
views
Algorithms
»
more
STOC 2000
»
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
13 years 9 months ago
Download
www.cs.uwaterloo.ca
Alexei Kitaev, John Watrous
claim paper
Read More »
18
click to vote
COCO
2001
Springer
107
views
Algorithms
»
more
COCO 2001
»
In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time
13 years 10 months ago
Download
www.math.ias.edu
Restricting the search space {0, 1}n to the set of truth tables of “easy” Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we ...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...
claim paper
Read More »
« Prev
« First
page 2 / 3662
Last »
Next »