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
6
search results - page 2 / 2
»
trs 2010
Sort
relevance
views
votes
recent
update
View
thumb
title
19
click to vote
RTA
2010
Springer
178
views
Theoretical Computer Science
»
more
RTA 2010
»
Closing the Gap Between Runtime Complexity and Polytime Computability
13 years 8 months ago
Download
cl-informatik.uibk.ac.at
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
Martin Avanzini, Georg Moser
claim paper
Read More »
« Prev
« First
page 2 / 2
Last »
Next »