Factorisation des polynômes à plusieurs variables à coefficients entiers
Factorisation sur des polynômes de degré élevé à l’aide d’un monomorphisme
Fast algorithms for finding a subdirect decomposition and interesting congruences of finite algebras
Fast multiplication of small numbers.
Fehleranalyse für die Gauß-Elimination zur Berechnung der Lösung minimaler Länge.
Finding a Minimum-Weight k-Link Path in Graphs with the Concave Monge Property and Applications.
Finding -partitions efficiently
We study the concept of an -partition of the vertex set of a graph , which includes all vertex partitioning problems into four parts which we require to be nonempty with only external constraints according to the structure of a model graph , with the exception of two cases, one that has already been classified as polynomial, and the other one remains unclassified. In the context of more general vertex-partition problems, the problems addressed in this paper have these properties: non-list, -part,...
Finding H-partitions efficiently
We study the concept of an H-partition of the vertex set of a graph G, which includes all vertex partitioning problems into four parts which we require to be nonempty with only external constraints according to the structure of a model graph H, with the exception of two cases, one that has already been classified as polynomial, and the other one remains unclassified. In the context of more general vertex-partition problems, the problems addressed in this paper have these properties: non-list, 4-part, external...
Finding Minimum Area k-gons.
Full approximability of a class of problems over power sets.
In this paper results concerning structural and approximability properties of the subclass of NP-Complete Optimization Problems, defined over a lattice are considered. First, various approaches to the concept of Fully Polynomial Approximation Scheme are presented with application to several known problems in the class of NP-Complete Optimization Problems.Secondly, a characterization of full Approximability for the class of Max Subset Problems is introduced.
Gaussian Elimination is not Optimal.
Generalizations of the standard travelling salesman problem
Generalized polar varieties and an efficient real elimination
Let be a closed algebraic subvariety of the -dimensional projective space over the complex or real numbers and suppose that is non-empty and equidimensional. In this paper we generalize the classic notion of polar variety of associated with a given linear subvariety of the ambient space of . As particular instances of this new notion of generalized polar variety we reobtain the classic ones and two new types of polar varieties, called dual and (in case that is affine) conic. We show that...
Generating functions and the satisfiability threshold.
Geometric algorithms and combinatorial optimization [Book]
Geometric algorithms and combinatorial optimization [Book]
Geometric Optimization and Dp-Completeness.
Géométrie des polynômes. Coût global moyen de la méthode de Newton
Halving point sets.
Hardness Results for Total Rainbow Connection of Graphs
A total-colored path is total rainbow if both its edges and internal vertices have distinct colors. The total rainbow connection number of a connected graph G, denoted by trc(G), is the smallest number of colors that are needed in a total-coloring of G in order to make G total rainbow connected, that is, any two vertices of G are connected by a total rainbow path. In this paper, we study the computational complexity of total rainbow connection of graphs. We show that deciding whether a given total-coloring...