{"id":"1509.08216","title":"Fast Algorithms for Finding Pattern Avoiders and Counting Pattern Occurrences in Permutations","url":"https://codeofpaper.com/paper/1509.08216","arxiv_url":"https://arxiv.org/abs/1509.08216","published":"2015-09-28","code":"official","best":{"full_name":"williamkuszmaul/patternavoidance","url":"https://github.com/williamkuszmaul/patternavoidance","tier":"official","stars":4,"license":"MIT","framework":null,"language":"C++","last_commit":"2016-11-23T21:34:11"},"most_starred_community":null,"implementations":[{"full_name":"williamkuszmaul/patternavoidance","url":"https://github.com/williamkuszmaul/patternavoidance","tier":"official","stars":4,"license":"MIT","framework":null,"language":"C++","last_commit":"2016-11-23T21:34:11"}],"possible_matches":0}