1469 search results - page 43 / 294 » Approximate polynomial decomposition |
DAGSTUHL
2006
14 years 11 months ago
2006
Given a set of monomials, the Minimum AND-Circuit problem asks for a circuit that computes these monomials using AND-gates of fan-in two and being of minimum size. We prove that t...
JACM
2007
14 years 9 months ago
2007
We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...
126
click to vote
ICIP
1998
IEEE
15 years 11 months ago
1998
IEEE
This paper outlines a geometric parameterization of 2D curves where the parameterization is in terms of geometric invariants and terms that determine an intrinsic coordinate system...
ICALP
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
ICDT
2010
ACM
14 years 8 months ago
2010
ACM
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...