Non-adaptive vs Adaptive Queries in the Dense Graph Testing Model
暂无分享,去创建一个
[1] Oded Goldreich,et al. Introduction to Property Testing , 2017 .
[2] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.
[3] Dana Ron,et al. On the Benefits of Adaptivity in Property Testing of Dense Graphs , 2010, Algorithmica.
[4] Noga Alon,et al. Efficient Testing of Large Graphs , 2000, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[5] Luca Trevisan,et al. Three Theorems regarding Testing Graph Properties , 2001, Electron. Colloquium Comput. Complex..
[6] Oded Goldreich,et al. Hierarchy Theorems for Property Testing , 2011, computational complexity.
[7] Oded Goldreich. On Testing Asymmetry in the Bounded Degree Graph Model , 2020, Electron. Colloquium Comput. Complex..
[8] Eshan Chattopadhyay. A Recipe for Constructing Two-Source Extractors∗ , 2020 .
[9] Avi Wigderson,et al. Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing , 2020, Electron. Colloquium Comput. Complex..
[10] Sofya Raskhodnikova,et al. A Note on Adaptivity in Testing Properties of Bounded Degree Graphs , 2006, Electron. Colloquium Comput. Complex..
[11] Eli Ben-Sasson,et al. 3CNF Properties are Hard to Test , 2003, Electron. Colloquium Comput. Complex..
[12] Ronen Shaltiel,et al. An Introduction to Randomness Extractors , 2011, ICALP.
[13] Dana Ron,et al. Algorithmic Aspects of Property Testing in the Dense Graphs Model , 2009, Electron. Colloquium Comput. Complex..
[14] Benny Sudakov,et al. On the asymmetry of random regular graphs and random graphs , 2002, Random Struct. Algorithms.
[15] Eldar Fischer. On the strength of comparisons in property testing , 2004, Inf. Comput..