Results 291 to 300 of about 2,188,345 (345)

A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata

SIAM Journal on Computing, 1992
The 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.
Wen-Guey Tzeng
openaire   +3 more sources

Pooling Problems with Polynomial-Time Algorithms

Journal of Optimization Theory and Applications, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Haugland, Dag, Hendrix, Eligius M.T.
openaire   +3 more sources

Polynomial-time algorithm for the orbit problem

Journal of the ACM, 1986
The accessibility problem for linear sequential machines [12] is the problem of deciding whether there is an input x such that on x the machine starting in a given state q 1 goes to a given state q 2 . Harrison shows that
Ravindran Kannan, Richard J. Lipton
openaire   +1 more source

A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing

IEEE Annual Symposium on Foundations of Computer Science, 2015
Symbolic matrices in non-commuting variables, and the related structural and algorithmic questions, have a remarkable number of diverse origins and motivations.
A. Garg, L. Gurvits, R. Oliveira, A. Wigderson   +3 more
semanticscholar   +1 more source

A polynomial time algorithm for subpattern matching

Proceedings of the IEEE, 1986
An O(N3K) time algorithm for searching matches of a template of size K in an image of size N is given. It uses bounding regions and the Soviet Ellipsoid Algorithm [1]. It will work under moderately heavy shift noise.
H. L. Nyo, Minsoo Suk
openaire   +1 more source

A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph

SIAM Journal on Computing, 1987
J. Horton
exaly   +2 more sources

General Polynomial Time Decomposition Algorithms

2005
We 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, 1993
Summary: 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, 2002
This 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, 2003
The 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