1092 search results - page 104 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
153
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
148
click to vote
FOCS
2008
IEEE
16 years 16 days ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
165
click to vote
CAIP
1995
Springer
15 years 9 months ago
1995
Springer
The Point Distribution Model (PDM) has already proved useful for many tasks involving the location or tracking of deformable objects. A principal limitation lies in the fact that n...
150
click to vote
STOC
2010
ACM
16 years 3 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
134
click to vote
DCC
2004
IEEE
16 years 5 months ago
2004
IEEE
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...