Results 11  20
of
323,526
PolynomialTime Algorithms for Learning Typed Pattern Languages ⋆
"... Abstract. This article proposes polynomialtime algorithms for learning typed pattern languages—formal languages that are generated by patterns consisting of terminal symbols and typed variables. A string is generated by a typed pattern by substituting all variables with strings of terminal symbols ..."
Abstract
 Add to MetaCart
Abstract. This article proposes polynomialtime algorithms for learning typed pattern languages—formal languages that are generated by patterns consisting of terminal symbols and typed variables. A string is generated by a typed pattern by substituting all variables with strings of terminal symbols
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.
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 118 (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 random polynomialtime algorithm for approximating the volume of convex bodies
, 1991
"... A randomized polynomialtime algorithm for approximating the volume of a convex body K in ndimensional Euclidean space is presented. The proof of correctness of the algorithm relies on recent theory of rapidly mixing Markov chains and isoperimetric inequalities to show that a certain random walk c ..."
Abstract

Cited by 147 (9 self)
 Add to MetaCart
A randomized polynomialtime algorithm for approximating the volume of a convex body K in ndimensional Euclidean space is presented. The proof of correctness of the algorithm relies on recent theory of rapidly mixing Markov chains and isoperimetric inequalities to show that a certain random walk
A Polynomialtime Algorithm for the ChangeMaking Problem
 Department of Computer Science, Cornell University
, 1994
"... The changemaking problem is the problem of representing a given value with the fewest coins possible from a given set of coin denominations. To solve this problem for arbitrary coin systems is NPhard [L]. We investigate the problem of determining whether the greedy algorithm always produces the op ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
the optimal result for a given coin system. Chang and Gill [CG] show that this can be solved in time polynomial in the size of the largest coin and in the number of coins. Kozen and Zaks [KZ] give a more efficient algorithm, and pose as an open problem whether there is an algorithm to solve this problem which
New polynomialtime algorithms for Camion bases
, 2006
"... Let M be a finite set of vectors in R n of cardinality m and H(M) ={{x ∈ R n: c T x = 0}:c ∈ M} the central hyperplane arrangement represented by M. An independent subset of M of cardinality n is called a Camion basis, if it determines a simplex region in the arrangement H(M). In this paper, we firs ..."
Abstract
 Add to MetaCart
, an algorithm which finds a Camion basis is presented. For certain classes of matrices, including totally unimodular matrices, it is proven to run in polynomial time and faster than the algorithm due to Fonlupt and Raco.
Results 11  20
of
323,526