301 Hits in 5.0 sec

A lifting and recombination algorithm for rational factorization of sparse polynomials

Martin Weimann
2010 Journal of Complexity  
We obtain a deterministic algorithm that can be seen as a sparse version of an algorithm of Lecerf, with a polynomial complexity in the volume of the Newton polytope.  ...  We propose a new lifting and recombination scheme for rational bivariate polynomial factorization that takes advantage of the Newton polytope geometry.  ...  Acknowledgments We thank José Ignacio Burgos and Martin Sombra for their careful reading and helpful comments. We thank the anonymous referees for their useful remarks.  ... 
doi:10.1016/j.jco.2010.06.005 fatcat:4ya4gy4ecjftdljzdkau2t4btm

Implementation of a new algorithm of computation of the Poincaré–Liapunov constants

Jaume Giné, Xavier Santallusia
2004 Journal of Computational and Applied Mathematics  
We describe its implementation in two di erent ways, by means of a computer algebra system and an algorithm in any computer language.  ...  Warsaw 28 (2002) 17) a new method to compute recursively all the Poincarà e-Liapunov constants as a function of the coe cients of the system for an arbitrary analytic system which has a perturbed linear  ...  For system (11) the maximum number of small-amplitude limit cycles which can bifurcate from the origin is at least three when f(x; y) = f 1 (x; y) + f 3 (x; y) where f i (x; y) are homogeneous polynomials  ... 
doi:10.1016/ fatcat:crrp6ekqnfcu3cuterdvpvr6tm

Ground State Connectivity of Local Hamiltonians [chapter]

Sevag Gharibian, Jamie Sikora
2015 Lecture Notes in Computer Science  
We show that the complexity of this question can range from QCMA-complete to PSPACE-complete, as well as NEXP-complete for an appropriately defined "succinct" version of the problem.  ...  Roughly, "ground state connectivity" corresponds to the natural question: Given two ground states |ψ> and |ϕ> of a local Hamiltonian H, is there an "energy barrier" (with respect to H) along any sequence  ...  Research at the Centre for Quantum Technologies at the National University of Singapore is partially funded by the Singapore Ministry of Education and the National Research Foundation, also through the  ... 
doi:10.1007/978-3-662-47672-7_50 fatcat:gkbjune5nbeqlovgmblxp4x2aa

Reachability Analysis Using Message Passing over Tree Decompositions [chapter]

Sriram Sankaranarayanan
2020 Lecture Notes in Computer Science  
This makes reachability analysis challenging for nonlinear systems with a large number of state variables. Our approach works by constructing a dependency graph among the variables of the system.  ...  Next, we use ideas from message passing developed originally for belief propagation over Bayesian networks to perform reachability analysis over the full state space in an efficient manner.  ...  Mohamed Amin Ben Sassi and Fabio Somenzi for helpful discussions, and the anonymous reviewers for their comments.  ... 
doi:10.1007/978-3-030-53288-8_30 fatcat:yqmxs65iznce7e4qurcxkejviy

Lecture Notes on Algorithmic Number Theory [article]

Daniele Venturi
2009 Electronic colloquium on computational complexity  
Acknowledgements: I would like to thank Renè for the time he spent reading these notes and for his suggestions, corrections and (above all) teachings, and Filippo Nuccio for his explanations and patience  ...  For this purpose, we first find an explicit formula for adding two divisors in canonical form, such that the result is still a divisor in canonical form.  ...  An ideal I R of a ring (R, +, •) is prime, if for each a, b ∈ R a • b ∈ I ⇒ a ∈ I or b ∈ I. which is an element of Z since ∆ ≡ 0 (mod 4).  ... 
dblp:journals/eccc/Venturi09 fatcat:hrsbrkvwqncdjbetgenai635fa

Theory of Evolutionary Algorithms (Dagstuhl Seminar 13271)

Benjamin Doerr, Nikolaus Hansen, Jonathan L. Shapiro, L. Darrell Whitley, Marc Herbstritt
2013 Dagstuhl Reports  
This report documents the talks and discussions of Dagstuhl Seminar 13271 "Theory of Evolutionary Algorithms".  ...  Topics intensively discussed include a complexity theory for randomized search heuristics, evolutionary computation in noisy settings, the drift analysis technique, and parallel evolutionary computation  ...  As an example, results were presented for clustering problems based on uniformly random data in the unit square.  ... 
doi:10.4230/dagrep.3.7.1 dblp:journals/dagstuhl-reports/DoerrHSW13 fatcat:bvetvtijcrchzifaxvoliosmly

The headlight cloud in NGC 628: An extreme giant molecular cloud in a typical galaxy disk

C. N. Herrera, J. Pety, A. Hughes, S. E. Meidt, K. Kreckel, M. Querejeta, T. Saito, P. Lang, M. J. Jimenez-Donaire, I. Pessa, D. Cormier, A. Usero (+16 others)
2019 Astronomy and Astrophysics  
We characterize the properties of the molecular and ionized gas that is spatially coincident with an extremely bright H ii region in the context of the NGC 628 galactic environment.  ...  Due to the large mass of the cloud, this phase of the its evolution is long enough for the impact of feedback on the excitation of the gas to be observed.  ...  We thank the anonymous referee for a prompt and helpful report that strengthened our manuscript. This paper makes use of the following ALMA data: ADS/JAO.ALMA#2012.1.00650.S and 2013.1.00532.S.  ... 
doi:10.1051/0004-6361/201936060 fatcat:tq37s3rouzhafhkyo6zy44dise

The headlight cloud in NGC 628: An extreme giant molecular cloud in a typical galaxy disk [article]

Cinthya N. Herrera, Jérôme Pety, Annie Hughes, Sharon E. Meidt, Kathryn Kreckel, Miguel Querejeta, Toshiki Saito, Philipp Lang, María Jesús Jiménez-Donaire, Ismael Pessa, Diane Cormier, Antonio Usero, Kazimierz Sliwa, Christopher Faesi (+12 others)
2019 arXiv   pre-print
Due to the cloud's large mass, this phase of the cloud's evolution is long enough for the impact of feedback on the excitation of the gas to be observed.  ...  In this paper, we study the brightest cloud traced in CO emission in the disk of NGC628. The cloud is spatially coincident with an extremely bright HII region.  ...  We thank the anonymous referee for a prompt and helpful report that strengthened our manuscript. This paper makes use of the following ALMA data: ADS/JAO.ALMA#2012.1.00650.S and 2013.1.00532.S.  ... 
arXiv:1910.14311v2 fatcat:r4ljz6nkxnhhljvrvji3gckvqi

IgRepertoireConstructor: a novel algorithm for antibody repertoire construction and immunoproteogenomics analysis

Yana Safonova, Stefano Bonissone, Eugene Kurpilyansky, Ekaterina Starostina, Alla Lapidus, Jeremy Stinson, Laura DePalatis, Wendy Sandoval, Jennie Lill, Pavel A. Pevzner
2015 Bioinformatics  
Here, we present the IGREPERTOIRECONSTRUCTOR algorithm that performs error-correction of immunosequencing reads and uses mass spectra to validate the constructed antibody repertoires.  ...  Therefore, the protein database required for the interpretation of spectra from circulating antibodies is custom for each individual.  ...  Hoffmann-La Roche in Moscow, Russia, for initiating this project as an international academia-industry collaboration and supporting it with a grant to Saint-Petersburg Academic University, Russia.  ... 
doi:10.1093/bioinformatics/btv238 pmid:26072509 pmcid:PMC4542777 fatcat:le4bgc5cxjcdxjiqs2gmvssb5a

Cuckoo Search Algorithm with Lévy Flights for Global-Support Parametric Surface Approximation in Reverse Engineering

Andrés Iglesias, Akemi Gálvez, Patricia Suárez, Mikio Shinya, Norimasa Yoshida, César Otero, Cristina Manchado, Valentin Gomez-Jauregui
2018 Symmetry  
Then, a recent metaheuristics called Cuckoo Search Algorithm (CSA) is applied to compute all relevant free variables of this minimization problem (namely, the data parameters and the surface poles).  ...  In this paper we address the general problem of global-support parametric surface approximation from clouds of data points for reverse engineering applications.  ...  Acknowledgments: This research work has received funding from the project PDE-GIR (Partial Differential Equations for Geometric modelling, Image processing, and shape Reconstruction) of the European Union's  ... 
doi:10.3390/sym10030058 fatcat:yermdvu3i5hhdnqvvxvozuyc6i

Page 6244 of Mathematical Reviews Vol. , Issue 90K [page]

1990 Mathematical Reviews  
The authors present a canonical simplifier for Lie fields us- ing Grébner bases of left and right ideals in enveloping algebras of Lie algebras. They also present an anti-isomorphism between  ...  A definition of a canonical representative of a left fraction independent of the algorithm for its computation is given.  ... 

A survey on signature-based Gröbner basis computations [article]

Christian Eder, Jean-Charles Faugère
2014 arXiv   pre-print
This paper is a survey on the area of signature-based Gr\"obner basis algorithms that was initiated by Faug\'ere's F5 algorithm in 2002. We explain the general ideas behind the usage of signatures.  ...  For this we give translations between different notations and show that besides notations many approaches are just the same.  ...  An F5 variant for SAGBI Gröbner bases Faugère and Rahmany presented in 2009 an adjusted variant of F5 for computing so-called SAGBI Gröbner bases ( [43] ).  ... 
arXiv:1404.1774v1 fatcat:y5zp7jm3gfe7xozltjm3ekcx54

Groebner-Shirshov bases for free inverse semigroups [article]

L. A. Bokut, Yuqun Chen, Xiangui Zhao
2013 arXiv   pre-print
A new construction of a free inverse semigroup was obtained by Poliakova and Schein in 2005.  ...  Based on their result, we find a Groebner-Shirshov basis of a free inverse semigroup relative to the deg-lex order of words.  ...  Buchberger, An algorithm for finding a basis for the residue class ring of a zero- dimensional polynomial ideal (in German), Ph. D. thesis, University of Innsbruck, Austria, 1965. [19] B.  ... 
arXiv:0804.0959v4 fatcat:yveqy7pptfhihlacuvcfz6npyi

Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem

Pierrick Gaudry
2009 Journal of symbolic computation  
We propose an index calculus algorithm for the discrete logarithm problem on general abelian varieties of small dimension.  ...  We apply this algorithm to the Weil restriction of elliptic curves and hyperelliptic curves over small degree extension fields.  ...  Thank you also to Andreas Enge who made a careful reading of an early version of this work and toÉric Schost for his help with the complexity of Gröbner basis computations.  ... 
doi:10.1016/j.jsc.2008.08.005 fatcat:gl2zqrto2ncg5ckyca3wyqk6ju

Page 1296 of Mathematical Reviews Vol. , Issue 2002B [page]

2002 Mathematical Reviews  
Sutre, An algorithm construct- ing the semilinear post for 2-dim reset/transfer VASS (extended abstract) (353-362); D. A. Fotakis, S. E. Nikoletseas, V. G. Pa- padopoulou and P. G.  ...  Frangois Lemaire, Computing canonical representatives of regular differential ideals (38-47 (elec- tronic)); Christopher W.  ... 
« Previous Showing results 1 — 15 out of 301 results