Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Complexity analysis for term rewriting by integer transition systems
We present a new method to infer upper bounds on the innermost runtime complexity of term
rewrite systems (TRSs), which benefits from recent advances on complexity analysis of …
rewrite systems (TRSs), which benefits from recent advances on complexity analysis of …
Formal proof of polynomial-time complexity with quasi-interpretations
H Férée, S Hym, M Mayero, JY Moyen… - Proceedings of the 7th …, 2018 - dl.acm.org
We present a Coq library that allows for readily proving that a function is computable in
polynomial time. It is based on quasi-interpretations that, in combination with termination …
polynomial time. It is based on quasi-interpretations that, in combination with termination …
On Sharing, Memoization, and Polynomial Time
We study how the adoption of an evaluation mechanism with sharing and memoization
impacts the class of functions which can be computed in polynomial time. We first show how …
impacts the class of functions which can be computed in polynomial time. We first show how …
[HTML][HTML] On sharing, memoization, and polynomial time
We study how the adoption of an evaluation mechanism with sharing and memoization
impacts the class of functions which can be computed in polynomial time. We first show how …
impacts the class of functions which can be computed in polynomial time. We first show how …
Investigating the expressivity of linear logic subsystems characterizing polynomial time
M Perrinel - 2015 - theses.hal.science
Implicit computational complexity is the characterization of complexity classes by syntactic
restrictions on computation models. Several subsystems of linear logic characterizing …
restrictions on computation models. Several subsystems of linear logic characterizing …
[PDF][PDF] Aachen
We present a new method to infer upper bounds on the innermost runtime complexity of term
rewrite systems (TRSs), which benefits from recent advances on complexity analysis of …
rewrite systems (TRSs), which benefits from recent advances on complexity analysis of …
On Sharing, Memoization, and Polynomial Time (Long Version)
We study how the adoption of an evaluation mechanism with sharing and memoization
impacts the class of functions which can be computed in polynomial time. We first show how …
impacts the class of functions which can be computed in polynomial time. We first show how …