query: Efficiently implement %LIKE% in Java with complexity better than O(n*m)
positive_passages.docid: 143290
positive_passages.text: How to implement a SQL like 'LIKE' operator in java?
negative_passages.docid: 62210
negative_passages.text: Fuzzy string search library in Java
negative_passages.docid: 79582
negative_passages.text: Nested Bounded Wildcard
negative_passages.docid: 152428
negative_passages.text: Tools for measuring empirical computational complexity of Java codes?
negative_passages.docid: 104503
negative_passages.text: Asymptotic time complexity of inserting n elements to a binary heap already containing n elements
negative_passages.docid: 71079
negative_passages.text: Big class decomposition in Java
negative_passages.docid: 87508
negative_passages.text: min change greedy algorithm in java
negative_passages.docid: 136033
negative_passages.text: Is there a hash tree scheme designed for complex data structures?
negative_passages.docid: 87643
negative_passages.text: what is the time complexity of .equals in java for 2 strings?
negative_passages.docid: 98850
negative_passages.text: A positional number system for enumerating fixed-size subsets?
negative_passages.docid: 36964
negative_passages.text: How can I put a curly brace inside an algorithm to group code lines?
negative_passages.docid: 92183
negative_passages.text: Pair-wise iteration in C# or sliding window enumerator
negative_passages.docid: 79543
negative_passages.text: Python element-wise tuple operations like sum
negative_passages.docid: 62238
negative_passages.text: Case-insensitive array search
negative_passages.docid: 150597
negative_passages.text: How can I specify a long list of math operators?
negative_passages.docid: 18520
negative_passages.text: The tilde operator in Python
negative_passages.docid: 39969
negative_passages.text: Algorithms for computing multiplicative order modulo $n$