Abstract
We initiate the study of testing for general forbidden posets in a colored ordered rooted forest whose structure is fixed. First, we consider the case where the forbidden set consists of (ancestral) chains, and second, we consider the case in which it consists of one general ordered rooted forest. For both cases, we provide 1-sided error, non-adaptive tests, whose query complexity is polynomial in ∊-1 and is independent of the input size and the number of colors. Both tests do not require additional time complexity beyond the complexity of making the queries, except an O(n) time preprocessing stage in the test for a set of chains.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Foundations of Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
