1265 search results - page 31 / 253 » Finding the Key to a Synapse |
MOC
2010
13 years 3 months ago
2010
Abstract. Many key algorithms in 3-manifold topology involve the enumeration of normal surfaces, which is based upon the double description method for finding the vertices of a con...
AAECC
2009
Springer
13 years 10 months ago
2009
Springer
In this paper a full categorization of irreducible classical Goppa codes of degree 4 and length 9 is given. It is an interesting example in the context of find the number of permut...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
In this article we present a refined summation theory based on Karr's difference field approach. The resulting algorithms find sum representations with optimal nested depth. ...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxili...
JSC
2006
13 years 8 months ago
2006
We describe a new software package, named SumCracker, for proving and finding identities involving symbolic sums and related objects. SumCracker is applicable to a wide range of e...