### Table 1 Time complexity

2006

"... In PAGE 17: ... The number of mappings is bounded by size(G)size(Q) and testing is obviously polynomial in the size of Q and G. It follows that all NP-complete problems in Table1 are polynomial for data complexity. They remain NP-complete for query complexity (one obtains the H-coloring problem [28]).... ..."

Cited by 2

### TABLE I Time Complexity

### Table 2: Time complexity

### Table 2. Time Complexity of algorithms Algorithm Time Complexity Space Complexity

"... In PAGE 7: ... We used these experiments hoping to show the bounds of each algorithm. The timing complexity for each algorithm is listed in Table2 . We used these complexities to design several experiments to determine the upper limits for completion of each algorithm.... ..."

### Table 2. Time Complexity for ODA

"... In PAGE 28: ...his follows from Lemma 5.5 and Lemma 5.6 2 5.5 Time Complexity Table2 gives the worst case time complexity for all the algorithms used by the Optimal Decomposing Algorithm (ODA). We rst calculate the time complexity of the CHECK algorithm.... ..."

### Table 1. Time complexity comparison.

in Design and Evaluation of Parallel String Matching Algorithms for Network Intrusion Detection Systems

"... In PAGE 6: ... The time complexity of MT-ROMP is O( n threadNumber + (L 1)) = O( n threadNumber + L), as the longest pattern string can span across two regions of the payload. Table1 shows the time complexity comparison of... ..."