Results 301 to 310 of about 2,188,345 (345)
Some of the next articles are maybe not open access.
A Polynomial Time Algorithm for Shaped Partition Problems
SIAM Journal on Optimization, 1999Summary: We consider the class of shaped partition problems of partitioning \(n\) given vectors in \(d\)-dimensional criteria space into \(p\) parts so as to maximize an arbitrary objective function which is convex on the sum of vectors in each part, subject to arbitrary constraints on the number of elements in each part.
Frank K. Hwang +2 more
openaire +1 more source
A Polynomial-Time Algorithm for Memory Space Reduction
International Journal of Parallel Programming, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yonghong Song +2 more
openaire +2 more sources
Polynomial time algorithms for Galois groups
2005In this paper we present several polynomial time algorithms for Galois groups. We show: (i) There are polynomial time algorithms to determine: (a) If the Galois group of an irreducible polynomial over Q is a p-group. (b) the prime divisors of the order of a solvable Galois group (ii) Using the ...
openaire +1 more source
Algorithmic Statistics and Prediction for Polynomial Time-Bounded Algorithms
2018Algorithmic statistics studies explanations of observed data that are good in the algorithmic sense: an explanation should be simple i.e. should have small Kolmogorov complexity and capture all the algorithmically discoverable regularities in the data. However this idea can not be used in practice as is because Kolmogorov complexity is not computable.
openaire +1 more source
A polynomial time algorithm for the ground state of one-dimensional gapped local Hamiltonians
Nature Physics, 2015Zeph Landau, U. Vazirani, T. Vidick
semanticscholar +1 more source
A polynomial time algorithm for Minkowski reconstruction
Proceedings of the eleventh annual symposium on Computational geometry - SCG '95, 1995Peter Gritzmann, Alexander Hufnagel
openaire +1 more source
A polynomial-time algorithm, based on Newton's method, for linear programming
Mathematical programming, 1988J. Renegar
semanticscholar +1 more source
A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 1993A. Barvinok
semanticscholar +1 more source
European Journal of Operational Research, 2012
B. Hellion, Fabien Mangione, B. Penz
semanticscholar +1 more source
B. Hellion, Fabien Mangione, B. Penz
semanticscholar +1 more source

