Strongly sublinear algorithms for testing pattern freeness
From MaRDI portal
Publication:6566461
Cites work
- scientific article; zbMATH DE number 2081004 (Why is no real title available?)
- scientific article; zbMATH DE number 1504588 (Why is no real title available?)
- scientific article; zbMATH DE number 1418269 (Why is no real title available?)
- scientific article; zbMATH DE number 7788453 (Why is no real title available?)
- Erasure-Resilient Property Testing
- Estimating the longest increasing sequence in polylogarithmic time
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Fast property testing and metrics for permutations
- Finding and counting permutations via CSPs
- Finding monotone patterns in sublinear time, adaptively
- Finding small patterns in permutations in linear time
- Improved bounds for testing forbidden order patterns
- On Complexity of the Subpattern Problem
- On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
- On the number of permutations avoiding a given pattern
- On the strength of comparisons in property testing
- Optimal bounds for monotonicity and Lipschitz testing over hypercubes and hypergrids
- Parameterized property testing of functions
- Property testing and its connection to learning and approximation
- Regular languages are testable with a constant number of queries
- Robust Characterizations of Polynomials with Applications to Program Testing
- Spot-checkers
- Testing for forbidden order patterns in an array
- The solution of a conjecture of Stanley and Wilf for all layered patterns
- Transitive-closure spanners
This page was built for publication: Strongly sublinear algorithms for testing pattern freeness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566461)
