DOIAbstract
Categories and Subject Descriptors I.1.2 [Computing Methodologies]: Symbolic and Algebraic Manipulation--Algorithm
Categories and Subject Descriptors I.1.2 [Computing Methodologies]: Symbolic and Algebraic Manipulation--Algorithm
International audienceAlgebra and number theory have always been counted among the most beautiful ma...
One may represent polynomials not only by their coefficients but also by arithmetic circuits which e...
Polynomial multiplication is as close to any problem comes to being “classical” in the field of comp...
The purpose of the thesis is to get a better understanding of computer algebra in general, and polyn...
Abstract. Since programming languages are Turing complete, it is impossible to decide for all progra...
Abstract. We survey the area of algebraic complexity theory; with the focus being on the problem of ...
AbstractIn this paper we give a computer proof of a new polynomial identity, which extends a recent ...
Devising an efficient deterministic – or even a non-deterministic sub-exponential time – algorithm f...
We present a survey on polynomial identities of matrices over a field of characteristic 0 from compu...
8 pages, 2-column presentation, 2 figuresSo far, the scope of computer algebra has been needlessly r...
The talk gives a survey on some symbolic algorithmic methods for solving systems of algebraic equati...
his book that represents the author's Ph.D. thesis is devoted to applying symbolic methods to the pr...
Motivated by the fundamental lower bounds questions in proof complexity, we initiate the study of ma...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
sem informaçãoThis paper surveys some results on the role of formal polynomials as a representation ...
International audienceAlgebra and number theory have always been counted among the most beautiful ma...
One may represent polynomials not only by their coefficients but also by arithmetic circuits which e...
Polynomial multiplication is as close to any problem comes to being “classical” in the field of comp...
The purpose of the thesis is to get a better understanding of computer algebra in general, and polyn...
Abstract. Since programming languages are Turing complete, it is impossible to decide for all progra...
Abstract. We survey the area of algebraic complexity theory; with the focus being on the problem of ...
AbstractIn this paper we give a computer proof of a new polynomial identity, which extends a recent ...
Devising an efficient deterministic – or even a non-deterministic sub-exponential time – algorithm f...
We present a survey on polynomial identities of matrices over a field of characteristic 0 from compu...
8 pages, 2-column presentation, 2 figuresSo far, the scope of computer algebra has been needlessly r...
The talk gives a survey on some symbolic algorithmic methods for solving systems of algebraic equati...
his book that represents the author's Ph.D. thesis is devoted to applying symbolic methods to the pr...
Motivated by the fundamental lower bounds questions in proof complexity, we initiate the study of ma...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
sem informaçãoThis paper surveys some results on the role of formal polynomials as a representation ...
International audienceAlgebra and number theory have always been counted among the most beautiful ma...
One may represent polynomials not only by their coefficients but also by arithmetic circuits which e...
Polynomial multiplication is as close to any problem comes to being “classical” in the field of comp...
Add to ORKG