Results 61 to 70 of about 523 (176)

Cryptanalysis of novel extended multivariate public key cryptosystem

open access: yesTongxin xuebao, 2015
The novel extended multivariate public key cryptosystem is a new security enhancement method on multivariate public key cryptosystems,which is proposed by Qiao,et al.A nonlinear invertible transformation was used,named“tame transformation”,on the ...
Xu-yun NIE, Bo LIU, Gang LU, Ting ZHONG
doaj   +2 more sources

Geometric constraint subsets and subgraphs in the analysis of assemblies and mechanisms

open access: yesIngeniería y Ciencia, 2006
La habilidad del Razonamiento Geométrico es central a muchas aplicaciones de CAD/CAM/CAPP (Computer Aided Design, Manufacturing and Process Planning).
Oscar E. Ruiz
doaj  

SOLUSI SISTEM PERSAMAAN POLINOMIAL n-INDETERMINATE DENGAN BASIS GROEBNER [PDF]

open access: yes, 2006
Solusi sitem polinomial adalah n-tuple sedemikan hingga untuk setiap i. Solusi ini dapat dicari dengan memanfaatkan sifat-sifat basis Groebner dan dan resultan. Ide dasarnya adalah dengan memperluas solusi parsial yang dapat dari basis Groebner dan
HARJITO, HARJITO, AEMAH, UMU
core  

Groebner basis in Boolean rings is not polynomial-space

open access: yesCoRR, 2015
We give an example where the number of elements of a Groebner basis in a Boolean ring is not polynomially bounded in terms of the bitsize and degrees of the input.
openaire   +2 more sources

Towards an iterative method for approximate Groebner basis, revisited (Computer Algebra : Foundations and Applications)

open access: yes, 2022
In this talk, we briefly compare the NewtonSLRA/1 algorithm against the Cadzow's algorithm for computing a structured Groebner basis approximately, and discuss on a possibility of using signature based algorithms for computing approximate Groebner ...
長坂, 耕作
core  

Groebner Basis Under Composition

open access: yes, 1995
this paper is: When does composition commute with Groebner basis computation? We prove that this happens iff the composition is "compatible" with the term ordering and the un-divisibility.
Hoon Hong
core  

A probabilistic and deterministic modular algorithm for computing Groebner basis over $\Q$.

open access: yes, 2013
Modular algorithm are widely used in computer algebra systems (CAS), for example to compute efficiently the gcd of multivariate polynomials. It is known to work to compute Groebner basis over $\Q$, but it does not seem to be popular among CAS ...
Parisse, Bernard
core   +1 more source

Free integro-differential algebras and Groebner-Shirshov bases [PDF]

open access: yes, 2014
The notion of commutative integro-differential algebra was introduced for the algebraic study of boundary problems for linear ordinary differential equations. Its noncommutative analog achieves a similar purpose for linear systems of such equations.
Guo, Li   +5 more
core   +1 more source

Groebner Basis Procedures for Testing Petri Nets

open access: yes, 2000
This paper contains introductory material on Petri nets and Groebner basis theory and makes some observations on the relation between the two areas. The aim of the paper is to show how Groebner basis procedures can be applied to the problem of reachability in Petri nets, and to give details of an application to testing models of navigational systems.
Chandler, Angie, Heyworth, Anne
openaire   +2 more sources

ALGORITMA GROEBNER WALK LAMBAT?

open access: yes, 2009
Algoritma Groebner Walk dikembangkan karena Algoritma Buch‐berger memerlukan waktu dan memori yang sangat banyak untuk menghitung basis Groebner dari suatu ideal terhadap order leksikografis. Untuk menghitung basis Groebner terhadap order leksi‐kografis,
I, Made Sulandra
core  

Home - About - Disclaimer - Privacy