Results 1 to 10 of about 466 (33)
Efficient simplicial replacement of semialgebraic sets
Designing an algorithm with a singly exponential complexity for computing semialgebraic triangulations of a given semialgebraic set has been a holy grail in algorithmic semialgebraic geometry. More precisely, given a description of a semialgebraic set
Saugata Basu, Negin Karisani
doaj +1 more source
In this work, the generalized scale-invariant analog of the Korteweg–de Vries equation is studied. For the first time, the tanh–coth methodology is used to find traveling wave solutions for this nonlinear equation.
González-Gaxiola Oswaldo +1 more
doaj +1 more source
New exact solutions of the Mikhailov-Novikov-Wang equation via three novel techniques
The current work aims to present abundant families of the exact solutions of Mikhailov-Novikov-Wang equation via three different techniques. The adopted methods are generalized Kudryashov method (GKM), exponential rational function method (ERFM), and ...
Arzu Akbulut +2 more
doaj +1 more source
In the present work, we find the Lie point symmetries of the Ricci flow on an n-dimensional manifold, and we introduce a method in order to reutilize these symmetries to obtain the Lie point symmetries of particular metrics.
López Enrique +2 more
doaj +1 more source
Evolution of group-theoretic cryptology attacks using hyper-heuristics
In previous work, we developed a single evolutionary algorithm (EA) to solve random instances of the Anshel–Anshel–Goldfeld (AAG) key exchange protocol over polycyclic groups. The EA consisted of six simple heuristics which manipulated strings.
Craven Matthew J., Woodward John R.
doaj +1 more source
Attack on Kayawood protocol: uncloaking private keys
We analyze security properties of a two-party key-agreement protocol recently proposed by I. Anshel, D. Atkins, D. Goldfeld, and P. Gunnels, called Kayawood protocol.
Kotov Matvei +2 more
doaj +1 more source
Finite-dimensional Zinbiel algebras and combinatorial structures
In this paper, we study the link between finite-dimensional Zinbiel algebras and combinatorial structures or (pseudo)digraphs determining which configurations are associated with those algebras.
Ceballos Manuel +2 more
doaj +1 more source
A note on minimal resolutions of vector–spread Borel ideals
We consider vector–spread Borel ideals. We show that these ideals have linear quotients and thereby we determine the graded Betti numbers and the bigraded Poincaré series.
Crupi Marilena, Ficarra Antonino
doaj +1 more source
Quantum computation of discrete logarithms in semigroups
We describe an efficient quantum algorithm for computing discrete logarithms in semigroups using Shor's algorithms for period finding and the discrete logarithm problem as subroutines.
Childs Andrew M., Ivanyos Gábor
doaj +1 more source
On the resolvent of an ideal and some applications
We give an algorithm to compute a resolvent of an algebraic variety without computing its irreducible components; we decompose the radical of an ideal into prime ideals and we test the primality of a regular ideal.
Driss Bouziane, Abdelilah Kandri Rody
wiley +1 more source

