1308 search results - page 75 / 262 » Let's Have a Conversation |
COMBINATORICS
2002
14 years 11 months ago
2002
Let In() denote the number of involutions in the symmetric group Sn which avoid the permutation . We say that two permutations , Sj may be exchanged if for every n, k, and order...
MOC
2000
14 years 11 months ago
2000
Let (n) denote the sum of positive divisors of the natural number n. Such a number is said to be perfect if (n) = 2n. It is well known that a number is even and perfect if and only...
FFA
2010
14 years 9 months ago
2010
Let Fq be a finite field with q elements and p ∈ Fq[X, Y ]. In this paper we study properties of additive functions with respect to number systems which are defined in the rin...
111
Voted
ICSE
2009
IEEE-ACM
14 years 9 months ago
2009
IEEE-ACM
Configurable software lets users customize applications in many ways, and is becoming increasingly prevalent. Regression testing is an important but expensive way to build confide...
SKG
2006
IEEE
15 years 5 months ago
2006
IEEE
Semantic completeness and syntax completeness are important characters of the general formal systems, two the completeness have different meaning for a formal system. This paper a...