Factorisation des polynômes à plusieurs variables à coefficients entiers
Page 1
Displaying 1 – 10 of 10
Factorisation sur des polynômes de degré élevé à l’aide d’un monomorphisme
Guy Viry (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Fast algorithms for finding a subdirect decomposition and interesting congruences of finite algebras
Jiří Demel (1982)
Kybernetika
Fast multiplication of small numbers.
Puchta, Jan-Christoph (2000)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Fehleranalyse für die Gauß-Elimination zur Berechnung der Lösung minimaler Länge.
W. Sautter (1978)
Numerische Mathematik
Finding a Minimum-Weight k-Link Path in Graphs with the Concave Monge Property and Applications.
A. Aggarwal, B. Schieber, T. Tokuyama (1994)
Discrete & computational geometry
Finding -partitions efficiently
Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier, Sulamita Klein (2005)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
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
Simone Dantas, Celina M.H. de Figueiredo, Sylvain Gravier, Sulamita Klein (2010)
RAIRO - Theoretical Informatics and Applications
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.
D. Eppstein, M. Overmars, G Rote, G. Woeginger (1992)
Discrete & computational geometry
Full approximability of a class of problems over power sets.
Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi (1981)
Qüestiió
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.
Currently displaying 1 – 10 of 10
Page 1