Results 1  10
of
1,903,411
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 857 (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
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
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 1278 (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
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
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.
Polynomial Time Algorithms for Network Information Flow
 in 15th ACM Symposium on Parallel Algorithms and Architectures
, 2003
"... The famous maxflow mincut 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 mincut separating s and t. Recently it has been shown that this rate can also be achieved for multicasting to several sinks provided that t ..."
Abstract

Cited by 122 (1 self)
 Add to MetaCart
that the intermediate nodes are allowed to reencode the information they receive. In contrast, we present graphs where without coding the rate must be a factor jV j) smaller. However, so far no fast algorithms for constructing appropriate coding schemes were known. Our main result are polynomial time algorithms
A Polynomial Time Algorithm for Hamilton Cycle (Path)
"... Abstract: This research develops a polynomial time algorithm for Hamilton Cycle(Path) and proves its correctness. A program is developed according to this algorithm and it works very well. This paper declares the research process, algorithm as well as its proof, and the experiment data. Even only th ..."
Abstract
 Add to MetaCart
Abstract: This research develops a polynomial time algorithm for Hamilton Cycle(Path) and proves its correctness. A program is developed according to this algorithm and it works very well. This paper declares the research process, algorithm as well as its proof, and the experiment data. Even only
A POLYNOMIAL TIME ALGORITHM FOR SAT
, 2009
"... Abstract. We define a relation of compatibility on partial true assignments using the system’s equations. The relation is a Boolean matrix the compatibility matrix. We deplete the matrix eliminating relations between those partial true assignments which are not parts of a solution of the whole syst ..."
Abstract
 Add to MetaCart
Abstract. We define a relation of compatibility on partial true assignments using the system’s equations. The relation is a Boolean matrix the compatibility matrix. We deplete the matrix eliminating relations between those partial true assignments which are not parts of a solution of the whole system. The depletion transforms the relation of compatibility on the set of partial true assignments into the relation of “they are parts of one solution of the system” on the set. The relation is a Boolean matrix the general solution of a Boolean system. Values “true ” in the general solution indicate which partial true assignments can be extrapolated to a full solution and in which “directions ” the extrapolation has to be done. We use the method and solve SAT.
Results 1  10
of
1,903,411