2446 search results - page 26 / 490 » Choiceless Polynomial Time |
ISSAC
2009
Springer
14 years 2 months ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Given an n-element set U and a family of subsets S ⊆ 2U we show how to count the number of k-partitions S1 ∪ · · · ∪ Sk = U into subsets Si ∈ S in time 2nnO(1). The only...
WG
2005
Springer
14 years 1 months ago
2005
Springer
The Tutte polynomial is a notoriously hard graph invariant, and efficient algorithms for it are known only for a few special graph classes, like for those of bounded tree-width. Th...
APLAS
2005
ACM
14 years 1 months ago
2005
ACM
Affine size-change analysis has been used for termination analysis of eager functional programming languages. The same style of analysis is also capable of compactly recording and ...
CEC
2008
IEEE
14 years 2 months ago
2008
IEEE
—In this paper, we proposed a reduced polynomial neural swarm net (RPNSN) for the task of classification. Classification task is one of the most studied tasks of data mining. In ...