Author:
Jordan Charles,Zeugmann Thomas
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference50 articles.
1. Über die Erfüllbarkeit gewisser Zählausdrücke;Ackermann;Math. Ann.,1928
2. Efficient testing of large graphs;Alon;Combinatorica,2000
3. A combinatorial characterization of the testable graph properties: Itʼs all about regularity;Alon,2006
4. Regular languages are testable with a constant number of queries;Alon;SIAM J. Comput.,2001
5. Homomorphisms in graph property testing;Alon,2006
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献