We review the complexity of polynomial and matrix computations, as well as their various correlations to each other and some major techniques for the design of algebraic and numerical algorithms
An efficient evaluation method is described for polynomials in finite fields. Its complexity is show...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
We review the complexity of polynomial and matrix computations, as well as their various correlation...
This paper aims at a friendly introduction to the field of fast algorithms for polynomial matrices, ...
In recent years a number of algorithms have been designed for the "inverse" computational ...
Computational complexity is the study of the resources — time, memory, …— needed to algorithmically ...
(eng) We study the link between the complexity of polynomial matrix multiplication and the complexit...
La complexité algorithmique est l'étude des ressources nécessaires — le temps, la mémoire, … — pour ...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
The evaluation of several polynomial forms is considered. New algorithms for the evaluation of a pol...
AbstractWe estimate parallel complexity of several matrix computations under both Boolean and arithm...
I will discuss the basic notions related to the complexity theory. The classes of P and NP problems ...
Combination of algebraic and numerical techniques for improving the computations in algebra and geom...
This electronic version was submitted by the student author. The certified thesis is available in th...
An efficient evaluation method is described for polynomials in finite fields. Its complexity is show...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
We review the complexity of polynomial and matrix computations, as well as their various correlation...
This paper aims at a friendly introduction to the field of fast algorithms for polynomial matrices, ...
In recent years a number of algorithms have been designed for the "inverse" computational ...
Computational complexity is the study of the resources — time, memory, …— needed to algorithmically ...
(eng) We study the link between the complexity of polynomial matrix multiplication and the complexit...
La complexité algorithmique est l'étude des ressources nécessaires — le temps, la mémoire, … — pour ...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
The evaluation of several polynomial forms is considered. New algorithms for the evaluation of a pol...
AbstractWe estimate parallel complexity of several matrix computations under both Boolean and arithm...
I will discuss the basic notions related to the complexity theory. The classes of P and NP problems ...
Combination of algebraic and numerical techniques for improving the computations in algebra and geom...
This electronic version was submitted by the student author. The certified thesis is available in th...
An efficient evaluation method is described for polynomials in finite fields. Its complexity is show...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
DOI
Add to ORKG