Results 1  10
of
15
PRIMES is in P
 Ann. of Math
, 2002
"... We present an unconditional deterministic polynomialtime algorithm that determines whether an input number is prime or composite. 1 ..."
Abstract

Cited by 26 (2 self)
 Add to MetaCart
We present an unconditional deterministic polynomialtime algorithm that determines whether an input number is prime or composite. 1
Checking NFA equivalence with bisimulations up to congruence
"... Abstract—We introduce bisimulation up to congruence as a technique for proving language equivalence of nondeterministic finite automata. Exploiting this technique, we devise an optimisation of the classical algorithm by Hopcroft and Karp [12] that, instead of computing the whole determinised automa ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Abstract—We introduce bisimulation up to congruence as a technique for proving language equivalence of nondeterministic finite automata. Exploiting this technique, we devise an optimisation of the classical algorithm by Hopcroft and Karp [12] that, instead of computing the whole determinised automata, explores only a small portion of it. Although the optimised algorithm remains exponential in worst case (the problem is PSPACEcomplete), experimental results show improvements of several orders of magnitude over the standard algorithm. I.
THE LEAST COMMON MULTIPLE OF CONSECUTIVE TERMS IN ARITHMETIC PROGRESSIONS
, 903
"... Abstract. Let k ≥ 0, a ≥ 1 and b ≥ 0 be integers. We define the arithmetical function gk,a,b for any positive integer n by gk,a,b(n): = (b+na)(b+(n+1)a)···(b+(n+k)a) lcm(b+na,b+(n+1)a,·· ·,b+(n+k)a). Letting a = 1 and b = 0, then gk,a,b becomes the arithmetical function introduced previously by Farh ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. Let k ≥ 0, a ≥ 1 and b ≥ 0 be integers. We define the arithmetical function gk,a,b for any positive integer n by gk,a,b(n): = (b+na)(b+(n+1)a)···(b+(n+k)a) lcm(b+na,b+(n+1)a,·· ·,b+(n+k)a). Letting a = 1 and b = 0, then gk,a,b becomes the arithmetical function introduced previously by Farhi. Farhi proved gk,1,0 is periodical and k! is a period. Hong and Yang improved Farhi’s period k! to lcm(1, 2,...,k) and conjectured that lcm(1,2,...,k,k+1) k+1 divides the smallest positive period of gk,1,0. Recently, Farhi and Kane proved this conjecture and determined the smallest positive period of gk,1,0. For the general integers a ≥ 1 and b ≥ 0, it is natural to ask the interesting question: Whether gk,a,b is periodical? If the answer is affirmative, then one asks the further question: What is the smallest positive period of gk,a,b? In this paper, we mainly study these questions. We first show that the arithmetical function gk,a,b is periodical. Consequently, we provide detailed padic analysis to the periodical function gk,a,b. Finally, we determine the smallest positive period of gk,a,b. So we answer completely the above two questions. Our result extends the FarhiKane theorem from the set of positive integers to the general arithmetic progression. 1.
Branchingtime Model Checking of Onecounter Processes
 In Proc. of STACS, volume 5 of LIPIcs
, 2010
"... Abstract. Onecounter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CTL) over OCPs. A PSPACE upper bound is inherited from the modal µcalculus for this problem [20]. First, we ana ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. Onecounter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CTL) over OCPs. A PSPACE upper bound is inherited from the modal µcalculus for this problem [20]. First, we analyze the periodic behaviour of CTL over OCPs and derive a model checking algorithm whose running time is exponential only in the number of control locations and a syntactic notion of the formula that we call leftward until depth. In particular, model checking fixed OCPs against CTL formulas with a fixed leftward until depth is in P. This generalizes a corresponding result from [12] for the expression complexity of CTL’s fragment EF. Second, we prove that already over some fixed OCP, CTL model checking is PSPACEhard, i.e., expression complexity is PSPACEhard. Third, we show that there already exists a fixed CTL formula for which model checking of OCPs is PSPACEhard, i.e., data complexity is PSPACEhard as well. To obtain the latter result, we employ two results from complexity theory: (i) Converting a natural number in Chinese remainder presentation into binary presentation is in logspaceuniform NC 1 [8] and (ii) PSPACE is AC 0serializable [14]. We demonstrate that our approach can be used to obtain further results. We show that modelchecking CTL’s fragment EF over OCPs is hard for P NP, thus establishing a matching lower bound and answering an open question from [12]. We moreover show that the following problem is hard for PSPACE: Given a onecounter Markov decision process, a set of target states with counter value zero each, and an initial state, to decide whether the probability that the initial state will eventually reach one of the target states is arbitrarily close to 1. This improves a previously known lower bound for every level of the Boolean hierarchy shown in [5]. 1
Further improvements of lower bounds for the least common multiples of arithmetic progressions, arXiv:0811.4769v1 [math.NT] 28
, 2008
"... Abstract. For relatively prime positive integers u0 and r, we consider the arithmetic progression {uk: = u0 + kr} n k=0. We obtain a new lower bound on Ln:= lcm{u0, u1,..., un}, the least common multiple of the sequence {uk} n k=0. In particular, we show that Ln ≥ u0rα (r + 1) n whenever α ≥ 1 and n ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. For relatively prime positive integers u0 and r, we consider the arithmetic progression {uk: = u0 + kr} n k=0. We obtain a new lower bound on Ln:= lcm{u0, u1,..., un}, the least common multiple of the sequence {uk} n k=0. In particular, we show that Ln ≥ u0rα (r + 1) n whenever α ≥ 1 and n ≥ 2αr; this result improves the best previous bound for all but three choices of α, r ≥ 2. We sharpen this lower bound by an additional factor of r for all α, r ≥ 3. 1.
EXTENSIONS OF THE HERMITE G.C.D. THEOREMS FOR BINOMIAL COEFFICIENTS
, 1993
"... (n,k) nk + l (ra + U) ..."
THE CARDINALITY OF SOME SYMMETRIC DIFFERENCES
"... Abstract. In this paper, we prove that for positive integers k and n, thecardinality of the symmetric differences of {1, 2,...,k}, {2, 4,...,2k}, {3, 6,...,3k},..., {n, 2n,...,kn} is at least k or n, whichever is larger. This solved a problem raised by Pilz in which binary composition codes were stu ..."
Abstract
 Add to MetaCart
Abstract. In this paper, we prove that for positive integers k and n, thecardinality of the symmetric differences of {1, 2,...,k}, {2, 4,...,2k}, {3, 6,...,3k},..., {n, 2n,...,kn} is at least k or n, whichever is larger. This solved a problem raised by Pilz in which binary composition codes were studied. 1.
Deterministic Primality Testing in Polynomial Time
, 2006
"... The new AgrawalKayalSaxena (AKS) algorithm determines whether a given number is prime or composite in polynomial time, but, unlike the previous algorithms developed by Fermat, Miller, and Rabin, the AKS test is deterministic. The new test is not without its disadvantages, however; the older, error ..."
Abstract
 Add to MetaCart
The new AgrawalKayalSaxena (AKS) algorithm determines whether a given number is prime or composite in polynomial time, but, unlike the previous algorithms developed by Fermat, Miller, and Rabin, the AKS test is deterministic. The new test is not without its disadvantages, however; the older, errorprone MillerRabin test is accurate enough for nearly all numbers, and both experiment and analysis show that the AKS algorithm is, at present, still too slow to replace its predecessor. 1
AN EXPOSITION OF THE DETERMINISTIC POLYNOMIALTIME PRIMALITY TESTING ALGORITHM OF AGRAWALKAYALSAXENA
, 2005
"... of a thesis submitted by ..."