Results 11  20
of
2,154,130
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 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
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
Polynomial Time Algorithms for Some Evacuation Problems
, 1994
"... Evacuation problems can be modeled as flow problems on dynamic networks. A dynamic network is defined by a graph with capacities and integral transit times on its edges. The maximum dynamic flow problem is to send a maximum amount of flow from a source to a sink within a given time bound T ; convers ..."
Abstract

Cited by 44 (2 self)
 Add to MetaCart
applications and have been studied extensively. There are no polynomial time algorithms known for many of these problems, including the quickest flow problem with just two sources, each with a flow amount that must reach a single sink. The general multiple source quickest flow problem is commonly used as a
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
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
, 2009
"... We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the variables in a given symbolic matrix as to maximize the resulting matrix rank. Matrix completion belongs to the fundament ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
on this problem by allowing linear functions in the entries of the input matrix such that the submatrices corresponding to each variable have rank one. We present also a deterministic polynomial time algorithm for finding the minimal number of generators of a given module structure given by matrices. We establish
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
Polynomial Time Algorithms for some SelfDuality Problems
"... . Consider the problem of deciding whether a Boolean formula f is selfdual, i.e. f is logically equivalent to its dual formula f d , defined by f d (x) = ¯ f(¯x). This problem is a wellstudied problem in several areas like theory of coteries, database theory, hypergraph theory or computationa ..."
Abstract
 Add to MetaCart
or computational learning theory. In this paper we exhibit polynomial time algorithms for testing selfduality for several natural classes of formulas where the problem was not known to be solvable. Some of the results are obtained by means of a new characterization of selfdual formulas in terms of its Fourier
A Polynomial Time Algorithm for the NQueens Problem
, 1990
"... this paper we present a new, probabilistic local search algorithm which is based on a gradientbased heuristic. This efficient algorithm is capable of finding a solution for extremely large size nqueens problems. We give the execution statistics for this algorithm with n up to 500,000. Keywords: Ar ..."
Abstract

Cited by 35 (4 self)
 Add to MetaCart
this paper we present a new, probabilistic local search algorithm which is based on a gradientbased heuristic. This efficient algorithm is capable of finding a solution for extremely large size nqueens problems. We give the execution statistics for this algorithm with n up to 500,000. Keywords
RMAX  A General Polynomial Time Algorithm for NearOptimal Reinforcement Learning
, 2001
"... Rmax is a very simple modelbased reinforcement learning algorithm which can attain nearoptimal average reward in polynomial time. In Rmax, the agent always maintains a complete, but possibly inaccurate model of its environment and acts based on the optimal policy derived from this model. The mod ..."
Abstract

Cited by 294 (10 self)
 Add to MetaCart
Rmax is a very simple modelbased reinforcement learning algorithm which can attain nearoptimal average reward in polynomial time. In Rmax, the agent always maintains a complete, but possibly inaccurate model of its environment and acts based on the optimal policy derived from this model
Results 11  20
of
2,154,130