The paper focuses on the deterministic complexity of factoring polynomials over finite fields assuming the extended Riemann hypothesis (ERH). By the works of Berlekamp (1967, 1970) and Zassenhaus (1969), the general problem reduces deterministically in polynomial time to finding a proper factor of any squarefree and completely splitting polynomial over a prime field Fp . Algorithms are designed...

RATIONALE, AIMS AND OBJECTIVES The basic single-group interrupted time series analysis (ITSA) design has been shown to be susceptible to the most common threat to validity-history-the possibility that some other event caused the observed effect in the time series. A single-group ITSA with a crossover design (in which the intervention is introduced and withdrawn 1 or more times) should be more r...

Alberto Carraro1,2, Thomas Ehrhard2,⋆, and Antonino Salibra1,⋆⋆ 1 Department of Computer S ien e, Ca' Fos ari University, Veni e 2 PPS, UMR 7126, university Paris Diderot and CNRS Abstra t. Given a semi-ring with unit whi h satis es some onditions, we de ne an exponential fun tor on the ategory of sets and relations whi h allows to de ne a denotational model of Di erential Linear Logi and of th...

A deterministic polynomial time algorithm is presented for finding the distinctdegree factorization of multivariate polynomials over finite fields. As a consequence, one can count the number of irreducible factors of polynomials over finite fields in deterministic polynomial time, thus resolving a theoretical open problem of Kaltofen from 1987.

In this paper we study the identity testing problem of arithmetic read-once formulas (ROF) and some related models. A read-once formula is formula (a circuit whose underlying graph is a tree) in which the operations are {+,×} and such that every input variable labels at most one leaf. We obtain the first polynomial-time deterministic identity testing algorithm that operates in the black-box set...

Since the discovery of the largest positive superhump period in TV Col (6.4 h), we have started a program to search for superhumps in cataclysmic variables (CVs) with large orbital periods. In this work, we summarize preliminary results of our observations of TX Col and V4742 Sgr. TX Col is an intermediate polar with a 5.7-h orbital period. V4742 Sgr is a recent (2002) nova with no known period...

An RTP profile (SAVP) for secure real-time communications and another profile (AVPF) to provide timely feedback from the receivers to a sender are defined in RFC 3711 and RFC 4585, respectively. This memo specifies the combination of both profiles to enable secure RTP communications with feedback. Ott & Carrara Standards Track [Page 1] RFC 5124 February 2008 Table of

We provide evidence on the characteristics of local generally accepted accounting principles (GAAP) earnings for firms cross-listing on U.S. exchanges relative to a matched sample of foreign firms currently not cross-listing in the United States to investigate whether U.S. listing is associated with differences in accounting data reported in local markets. We find that cross-listed firms differ...