Results 1  10
of
11,729
A NEW POLYNOMIALTIME ALGORITHM FOR LINEAR PROGRAMMING
 COMBINATORICA
, 1984
"... We present a new polynomialtime algorithm for linear programming. In the worst case, the algorithm requires O(tf'SL) arithmetic operations on O(L) bit numbers, where n is the number of variables and L is the number of bits in the input. The running,time of this algorithm is better than the ell ..."
Abstract

Cited by 860 (3 self)
 Add to MetaCart
We present a new polynomialtime algorithm for linear programming. In the worst case, the algorithm requires O(tf'SL) arithmetic operations on O(L) bit numbers, where n is the number of variables and L is the number of bits in the input. The running,time of this algorithm is better than
PolynomialTime Algorithms for . . .
, 2011
"... Energy consumption of digital circuits has become a primary constraint in electronic design. The increasing popularity of the portable devices like smart phone, ipad, tablet and notebook has created an overwhelming demand for extended battery life of these devices. Numerous methods for energy reduct ..."
Abstract
 Add to MetaCart
voltage and the other two algorithms assign that lower voltage to individual gates. A linear time algorithm described in the literature is used for computing slacks for all gates in a circuit for a given supply voltage. The slack of a gate is the difference between the critical path delay and the delay
A PolynomialTime Algorithm for Statistical Machine Translation
 In 34th Annual Meeting of the Association for Computational Linguistics
, 1996
"... We introduce a polynomialtime algorithm for statistical machine translation. This algorithm can be used in place of the expensive, slow bestfirst search strategies in current statistical translation architectures. ..."
Abstract

Cited by 98 (10 self)
 Add to MetaCart
We introduce a polynomialtime algorithm for statistical machine translation. This algorithm can be used in place of the expensive, slow bestfirst search strategies in current statistical translation architectures.
Markov Chains and Polynomial time Algorithms
, 1994
"... 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 ..."
Abstract

Cited by 43 (0 self)
 Add to MetaCart
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
Polynomial time algorithms for multicast network code construction
 IEEE TRANS. ON INFO. THY
, 2005
"... The famous maxflow mincut theorem states that a source node can send information through a network ( ) to a sink node at a rate determined by the mincut separating and. Recently, it has been shown that this rate can also be achieved for multicasting to several sinks provided that the intermediat ..."
Abstract

Cited by 316 (29 self)
 Add to MetaCart
that the intermediate nodes are allowed to reencode the information they receive. We demonstrate examples of networks where the achievable rates obtained by coding at intermediate nodes are arbitrarily larger than if coding is not allowed. We give deterministic polynomial time algorithms and even faster randomized
A polynomialtime algorithm for the knapsack problem with . . .
, 1976
"... The general knapsack problem is known to be NPcomplete In this paper a very special knapsack problem is studied, namely, one with only two variables. A polynomialtime algorithm is presented and analyzed However, ~t remains an open problem that for any fixed n> 2, the knapsack problem with n va ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
The general knapsack problem is known to be NPcomplete In this paper a very special knapsack problem is studied, namely, one with only two variables. A polynomialtime algorithm is presented and analyzed However, ~t remains an open problem that for any fixed n> 2, the knapsack problem with n
A polynomialtime algorithm for global value numbering
 In Static Analysis Symposium, volume 3148 of LNCS
, 2004
"... We describe a polynomialtime algorithm for global value numbering, which is the problem of discovering equivalences among program subexpressions. We treat all conditionals as nondeterministic and all program operators as uninterpreted. We show that there are programs for which the set of all equi ..."
Abstract

Cited by 28 (16 self)
 Add to MetaCart
We describe a polynomialtime algorithm for global value numbering, which is the problem of discovering equivalences among program subexpressions. We treat all conditionals as nondeterministic and all program operators as uninterpreted. We show that there are programs for which the set of all
POLYNOMIALTIME ALGORITHMS FOR QUADRATIC ISOMORPHISM OF POLYNOMIALS
, 2013
"... ABSTRACT. Let K be a field, f= ( f1,..., fm) and g=(g1,...,gm) be two sets of m�1 nonlinear polynomials over K[x1,...,xn]. We consider the computational problem of finding – if any – an invertible transformation on the variables mapping f to g. The corresponding equivalence problem is known as Isom ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. This strongly suggests that solving equivalence problems efficiently, i.e. in polynomialtime, is a very challenging algorithmic task. Then, following Kayal at SODA’11, we search for large families of polynomials equivalence which can be solved efficiently. The main result is a randomized polynomialtime
PolynomialTime Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
 SIAM J. on Computing
, 1997
"... A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. ..."
Abstract

Cited by 1277 (4 self)
 Add to MetaCart
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration
Results 1  10
of
11,729