search

jwaldmann / star-exec-presenter

presentation platform for star-exec written in Haskell and based upon Yesod
2 stars 7 forks source link

must parse WORST_CASE(NON_POLY, ?) #103

Closed jwaldmann closed 8 years ago

jwaldmann commented 8 years ago

cross-reference: https://github.com/jwaldmann/plain-postproc/issues/5

ffrohn commented 8 years ago

While the results seem to be ok for the rewriting-categories, too many exponential lower bounds are reported in the category "complexity of c integer programs", see

http://nfa.imn.htwk-leipzig.de/termcomp-devel/results/complexity/noquery/17542

As far as I know, there is no tool with support for lower bounds in this category, so I guess '?' is falsely mapped to 'e'.

jwaldmann commented 8 years ago

I think this was fixed by the commit mentioned above. The data base contains stale entries. For new jobs, it should work: http://nfa.imn.htwk-leipzig.de/termcomp-devel/results/complexity/noquery/17841