Add to ORKGFinding an non-negative integer solution x∈ Znx1 for Ax = b (A∈Zmxn, b∈Zmxl) in Petri nets is NP-complete. Being NP-complete, even algorithms with theoretically bad worst case and with average complexity can be useful for a special class of problems, hence deserve investigation. Then a Groebner basis approach to integer programming problems was proposed in 1991 and some symbolic computation systems became to have useful tools for ideals, varieties, and algorithms for algebraic geometry. In this paper, two kinds of examples are given to show how Groebner basis approach is applied to reachability problems in Petri nets
In this paper a compact representation of the reachability graph of a Petri net is proposed. The tra...
AbstractUsing linear algebraic techniques, we analyse the computational complexity of testing reacha...
AbstractThe recent development of Computer Algebra allows us to take up problems of classical Ideal ...
One of methods to solve integer programming problems consists in the method which uses groebner base...
Finding integer solutions to linear equations has various real world applications. In the thesis, we...
We study Groebner bases and their applications in our thesis. We give a detailed proof of Dickson\u2...
This thesis combines topics from the field of Algebra and the field of Optimization. It will be disc...
The topics explored in this project present and interesting picture of close connections between alg...
Groebner basis are an important theoretical building block of modern (polynomial) ring theory. The o...
The theory of Grobner bases has garnered the interests of a large number of researchers in computati...
In this dissertation we study several improvements to algorithms used to generate comprehensive Groe...
An ideal I in a polynomial ring k[x1,...,xn] is a nonempty set closed under addition satisfying hf _...
Within the realm of mathematics, many problems can be translated into the solution sets of polynomia...
AbstractWe consider the complexity of several standard problems for various classes of Petri nets. I...
Grobner basis theory has been applied to the problem of graph coloring with novel results. A graph o...
In this paper a compact representation of the reachability graph of a Petri net is proposed. The tra...
AbstractUsing linear algebraic techniques, we analyse the computational complexity of testing reacha...
AbstractThe recent development of Computer Algebra allows us to take up problems of classical Ideal ...
One of methods to solve integer programming problems consists in the method which uses groebner base...
Finding integer solutions to linear equations has various real world applications. In the thesis, we...
We study Groebner bases and their applications in our thesis. We give a detailed proof of Dickson\u2...
This thesis combines topics from the field of Algebra and the field of Optimization. It will be disc...
The topics explored in this project present and interesting picture of close connections between alg...
Groebner basis are an important theoretical building block of modern (polynomial) ring theory. The o...
The theory of Grobner bases has garnered the interests of a large number of researchers in computati...
In this dissertation we study several improvements to algorithms used to generate comprehensive Groe...
An ideal I in a polynomial ring k[x1,...,xn] is a nonempty set closed under addition satisfying hf _...
Within the realm of mathematics, many problems can be translated into the solution sets of polynomia...
AbstractWe consider the complexity of several standard problems for various classes of Petri nets. I...
Grobner basis theory has been applied to the problem of graph coloring with novel results. A graph o...
In this paper a compact representation of the reachability graph of a Petri net is proposed. The tra...
AbstractUsing linear algebraic techniques, we analyse the computational complexity of testing reacha...
AbstractThe recent development of Computer Algebra allows us to take up problems of classical Ideal ...