2 search results for "tag:"category:Computer Science/Algorithms/Complexity""
Showing 1 - 2
-
coq-bellantonicook
No documentation
Deep embedding of Bellantoni and Cook's syntactic characterization of polytime functions1.0.0CeCILL-AUsed by 1 other packages07 Sep 2018 -
coq-cecoa
No documentation
Implicit-complexity Coq library to prove that some programs are computable in polynomial time1.0.0CeCILL-AUsed by 0 other packages13 Sep 2018