The following pages link to Kitti Gelle (Q1642813):
Displayed 12 items.
- Basin hopping networks of continuous global optimization problems (Q1642814) (← links)
- Recognizing union-find trees is NP-complete (Q1685019) (← links)
- The syntactic complexity of semi-flower languages (Q2179334) (← links)
- The ordinal generated by an ordinal grammar is computable (Q2326394) (← links)
- Recognizing union-find trees built up using union-by-rank strategy is NP-complete (Q2400998) (← links)
- The Order Type of Scattered Context-Free Orderings of Rank One Is Computable (Q3297776) (← links)
- DFS is Unsparsable and Lookahead Can Help in Maximal Matching (Q4584659) (← links)
- (Q5016363) (← links)
- (Q5020534) (← links)
- Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info (Q5205041) (← links)
- Regular Expressions for Muller Context-Free Languages (Q5350161) (← links)
- Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata (Q6114868) (← links)