1092 search results - page 9 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
130
Voted
ICVS
2003
Springer
15 years 7 months ago
2003
Springer
This paper presents a new scenario recognition algorithm for Video Interpretation. We represent a scenario model with the characters involved in the scenario, with its sub-scenario...
122
click to vote
STOC
1993
ACM
15 years 5 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
123
click to vote
MST
2010
15 years 5 days ago
2010
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
106
Voted
COCO
2007
Springer
15 years 8 months ago
2007
Springer
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...
COCO
2009
Springer
15 years 8 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...