Searching for "On the Complexity of Kings." – sorted by Relevance.
-
An efficient sorting algorithm for a sequence of kings in a tournament
- with a complexity of (n 2 ). Keywords: King, sorting algorithm, tournament, median order, local median
- Cited by 2 (2 self) – Add To MetaCart
-
Singular chain intersection homology for traditional and super-perversities
- chain complex of King [15] and then discuss the generalizations necessary to work with local
- Cited by 1 (1 self) – Add To MetaCart
-
Fast reliable level-lines segments extraction. ICTTA
- using a distance threshold equal to 1.6 5. Benchmark The theoretical complexity of such king
- Cited by 1 (1 self) – Add To MetaCart
-
Complexity of the Undirected Radius and Diameter Problems for Succinctly Represented Graphs
- for higher levels of the polynomial hierarchy. 1 Introduction In the paper On the Complexity of Kings [1
- Add To MetaCart
-
Clustering by common friends finds locally significant proteins mediating modules
- size 4, of which 46 matched a known MIPS complex. In comparison, King et al., who used the same yeast
- Cited by 2 (1 self) – Add To MetaCart
-
A Virtual Exploration of the Lost Labyrinth: Developing a . . .
- constructed a large cult complex (approximately 120 metres by 300 metres), in which the king was worshipped
- Cited by 3 (0 self) – Add To MetaCart
-
The Cornell environment
- complexity was king 9 and life thereafter Chair, Computer Science Al Borodin Professor, Computer Science
- Add To MetaCart

