scientific article
From MaRDI portal
zbMath1162.68035MaRDI QIDQ3615896
Publication date: 24 March 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in artificial intelligence (68T01)
Related Items
Testing whether the uniform distribution is a stationary distribution, An adaptivity hierarchy theorem for property testing, An optimal tester for \(k\)-linear, Approximate membership for regular languages modulo the edit distance, On one-sided testing affine subspaces, A local decision test for sparse polynomials, An optimal tester for \(k\)-Linear, Hierarchy theorems for property testing, Testing shape restrictions of discrete distributions, Testable and untestable classes of first-order formulae, Efficiently testing sparse \(\text{GF}(2)\) polynomials, An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity, Non-interactive proofs of proximity, Property testing lower bounds via communication complexity, Fast distributed algorithms for testing graph properties, A unified framework for testing linear‐invariant properties
