1092 search results - page 54 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
JSC
2008
14 years 11 months ago
2008
We describe algorithms for solving a given system of multivariate polynomial equations via the Rational Univariate Reduction (RUR). We compute the RUR from the toric resultant of ...
CP
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
KDD
2009
ACM
15 years 6 months ago
2009
ACM
To discover patterns in historical data, climate scientists have applied various clustering methods with the goal of identifying regions that share some common climatological beha...
JMLR
2006
14 years 11 months ago
2006
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...