Results 231 to 240 of about 49,138 (261)

Polynomial time algorithms for Galois groups

2005
In 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, 1984
This 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

Algorithmic Statistics and Prediction for Polynomial Time-Bounded Algorithms

2018
Algorithmic 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 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.
openaire   +2 more sources

POLYNOMIALLY BOUNDED (-TIME) ALGORITHM (Polynomial algorithm)

2001
Saul I. Gass, Carl M. Harris
openaire   +1 more source

A polynomial time algorithm for Minkowski reconstruction

Proceedings of the eleventh annual symposium on Computational geometry - SCG '95, 1995
Peter Gritzmann, Alexander Hufnagel
openaire   +1 more source

POLYNOMIALLY BOUNDED (-TIME) ALGORITHM ( Polynomial algorithm)

2011
openaire   +1 more source

Polynomially Bounded (−Time) Algorithm (Polynomial Algorithm)

2013
openaire   +1 more source

Polynomial Time Algorithms

2020
openaire   +1 more source

A polynomial-time algorithm for finding ε in DEA models

Computers and Operations Research, 2004
Gholam R Amin, Mehdi Toloo
exaly