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
16
search results - page 4 / 4
»
amai 2005
Sort
relevance
views
votes
recent
update
View
thumb
title
14
click to vote
AMAI
2005
Springer
80
views
Artificial Intelligence
»
more
AMAI 2005
»
Resolution cannot polynomially simulate compressed-BFS
13 years 4 months ago
Download
www.eecs.umich.edu
Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to...
DoRon B. Motter, Jarrod A. Roy, Igor L. Markov
claim paper
Read More »
« Prev
« First
page 4 / 4
Last »
Next »