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
351
search results - page 71 / 71
»
Classical Logic with Partial Functions
Sort
relevance
views
votes
recent
update
View
thumb
title
121
Voted
ECCC
2007
90
views
more
ECCC 2007
»
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
15 years 3 months ago
Download
www.newton.ac.uk
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
claim paper
Read More »
« Prev
« First
page 71 / 71
Last »
Next »