The complexity of depth-3 circuits computing symmetric Boolean functions
- 作者Guy Wolfovitz
- 卷第100卷
- 期第2期
- 印刷ISSN0020-0190
- 文件大小124.08KB
- 发表时间2006
- DOI10.1016/j.ipl.2006.06.008
- 页码41-46
同作者推荐
Guest EditorialJ. Derrick; M. Harman; R.M. Hierons · 2006
Oracles for Distributed TestingHierons, R.M. · 2012
On the testability of SDL specificationsR.M. Hierons; T.-H. Kim; H. Ural · 2004
Search Algorithms for Regression Test Case PrioritizationLi, Z.; Harman, M.; Hierons, R.M. · 2007
Overcoming observability problems in distributed test architecturesJ. Chen; R.M. Hierons; H. Ural · 2006
Using status messages in the distributed test architectureR.M. Hierons · 2009
Reducing the cost of applying adaptive test casesR.M. Hierons; H. Ural · 2007