no code implementations • 1 Aug 2016 • Beishui Liao, Kang Xu, Huaxin Huang
The results show that our approach not only dramatically decreases the time for computing p(E^\sigma), but also has an attractive property, which is contrary to that of existing approaches: the denser the edges of a PrAG are or the bigger the size of a given extension E is, the more efficient our approach computes p(E^\sigma).
