FCT
13 years 11 months ago
2001 Springer 
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousan...
FCT
13 years 11 months ago
2001 Springer 
Abstract. Generalising modules over associative rings, the notion of modules for an endofunctor of any category is well established and useful in large parts of mathematics includi...
FCT
13 years 11 months ago
2001 Springer
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
FCT
13 years 11 months ago
2001 Springer 
Abstract. The maximum intersection problem for a matroid and a greedoid, given by polynomial-time oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in...
FCT
13 years 11 months ago
2001 Springer
This paper presents the prediction-preserving reducibility with membership queries (pwm-reducibility) on formal languages, in particular, simple CFGs and finite unions of regular ...
|
Applied Computing