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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
127
Voted
FCT
2003
Springer
90
views
Applied Computing
»
more
FCT 2003
»
On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems
15 years 8 months ago
Download
www.ida.liu.se
Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
Andrzej Szalas
claim paper
Read More »