Skip to content

Verify code runs in polynomial time, benchmark #2

Description

@cacfd3a

performs linear and polynomial and exponential regression on some test cases n=0-100 and see which has the highest coefficient of determination; select this one and assert the it matches what we expect (linear for left-recursive unambiguous grammars, n^2, n^3 otherwise)

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Projects

    No projects

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions