681 search results - page 86 / 137 » General Polynomial Time Decomposition Algorithms |
112
Voted
ECCC
2000
15 years 7 days ago
2000
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element of a finite field Fp of p elements from rather short strings of...
135
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
108
Voted
DM
1998
15 years 3 days ago
1998
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive edges differ in colour. Let G be a 2-edge-coloured complete graph and let M b...
123
Voted
NIPS
1996
15 years 1 months ago
1996
To obtain classification systems with both good generalizat`ion performance and efficiency in space and time, we propose a learning method based on combinations of weak classifiers...
97
Voted
SSS
2010
Springer
14 years 10 months ago
2010
Springer
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...