Results 271 to 280 of about 73,753 (309)
Some of the next articles are maybe not open access.
General Polynomial Time Decomposition Algorithms
2005We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches the optimal solution. The number of iterations required to be within e of optimality grows linearly with 1/e and quadratically with the number m of variables.
Nikolas List, Hans Ulrich Simon
openaire +2 more sources
Polynomial-time approximation algorithms for the ising model
SIAM Journal on Computing, 1993Summary: The paper presents a randomized algorithm which evaluates the partition function of an arbitrary ferromagnetic Ising system to any specified degree of accuracy. The running time of the algorithm increases only polynomially with the size of the system (i.e., the number of sites) and a parameter which controls the accuracy of the result. Further
Mark Jerrum, Alistair Sinclair
openaire +2 more sources
Markov chains and polynomial time algorithms
Proceedings 35th Annual Symposium on Foundations of Computer Science, 2002This paper outlines the use of rapidly mixing Markov Chains in randomized polynomial time algorithms to solve approximately certain counting problems. They fall into two classes: combinatorial problems like counting the number of perfect matchings in certain graphs and geometric ones like computing the volumes of convex sets. >
openaire +1 more source
Polynomial time algorithms for network information flow
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, 2003The famous max-flow min-cut theorem states that a source node s can send information through a network (V,E) to a sink node t at a data rate determined by the min-cut separating s and t. Recently it has been shown that this rate can also be achieved for multicasting to several sinks provided that the intermediate nodes are allowed to reencode the ...
Sanders, P., Egner, S., Tolhuizen, L.
openaire +2 more sources
A Polynomial Time Algorithm For Fault Diagnosability
25th Annual Symposium onFoundations of Computer Science, 1984., 1984We present the first polynomial time algorithm for testing t-diagnosability. This is a significant advance in system level fault diagnosis. We also presented part of our analysis of t/s-diagnosability, including the fact that it is co-NP-complete and that there are polynomial algorithms for t/t and t/(t+1)-diagnosability.
openaire +1 more source
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
A new polynomial-time algorithm for linear programming
Combinatorica, 1984This paper discusses a new polynomial time algorithm for linear programming (LP). It is an interior point method whose worst case computational complexity is \(0(n^{3.5}L)\) arithmetic operations on 0(L) bit numbers, where n is the number of variables and L is the number of bits in the input.
openaire +1 more source
A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
SIAM Journal on Computing, 1992The author gives an \(O((n_ 1+n_ 2)^ 4)\) algorithm for determining whether two probabilistic automata with \(n_ 1\), respectively \(n_ 2\) states, are equivalent. The author studies the path equivalence problem for nondeterministic automata without \(\lambda\)-transitions and also the approximate equivalence problem for probabilistic automata.
openaire +2 more sources