
Optimal Adaptive Detection of Monotone Patterns
We investigate adaptive sublinear algorithms for detecting monotone patt...
read it

Finding monotone patterns in sublinear time
We study the problem of finding monotone subsequences in an array from t...
read it

Nearly LinearTime, Parallelizable Algorithms for NonMonotone Submodular Maximization
We study parallelizable algorithms for maximization of a submodular func...
read it

NearOptimal Algorithm for DistributionFree Junta Testing
In this paper, We firstly present an algorithm for the problem of distri...
read it

Exploring the Properties and Evolution of Neural Network Eigenspaces during Training
In this work we explore the information processing inside neural network...
read it

Deciding Monotone Duality and Identifying Frequent Itemsets in Quadratic Logspace
The monotone duality problem is defined as follows: Given two monotone f...
read it

Griddings of permutations and hardness of pattern matching
We study the complexity of the decision problem known as Permutation Pat...
read it
Improved algorithm for permutation testing
We study the problem of testing forbidden patterns. The patterns that are of significant interest include monotone pattern and (1,3,2)pattern. For the problem of testing monotone patterns, <cit.> propose a nonadaptive algorithm with query complexity (log n)^O(k^2). <cit.> then improve the query complexity of nonadaptive algorithm to Ω((log n)^⌊log k⌋). Further, <cit.> propose an adaptive algorithm for testing monotone pattern with optimal query complexity O(log n). However, the adaptive algorithm and the analysis are rather complicated. We provide a simple adaptive algorithm with onesided error for testing monotone permutation. We also present an algorithm with improved query complexity for testing (1,3,2)pattern.
READ FULL TEXT
Comments
There are no comments yet.