Author:
Lin Hong-Yiu,Lyuu Yuh-Dauh,Ma Tak-Man,Ti Yen-Wu
Subject
General Computer Science,Theoretical Computer Science
Reference21 articles.
1. Robust characterizations of polynomials with applications to program testing;Rubinfeld;SIAM J. Comput.,1996
2. On the time required to detect cycles and connectivity in graphs;Holt;Math. Syst. Theory,1972
3. Complete subgraphs are elusive;Bollobás;J. Combin. Theory Ser. B,1976
4. Catherine E. Chronaki, A survey of evasiveness: Lower bounds on the decision-tree complexity of boolean functions, Available on: http://www.ics.forth.gr/~chronaki/papers/ur/eve.ps, 2002
5. David G. Kirkpatrick, Determining graph properties from matrix representations, in: STOC, 1974, pp. 84–90