Sciweavers

4403 search results - page 291 / 881
» Galois Theory of Algorithms
Sort
View
137
Voted
ANTS
2008
Springer
108views Algorithms» more  ANTS 2008»
15 years 8 months ago
Some Improvements to 4-Descent on an Elliptic Curve
The theory of 4-descent on elliptic curves has been developed in the PhD theses of Siksek [18], Womack [21] and Stamminger [20]. Prompted by our use of 4-descent in the search for ...
Tom Fisher
IPCO
2007
81views Optimization» more  IPCO 2007»
15 years 8 months ago
Matching Problems in Polymatroids Without Double Circuits
According to the present state of the theory of the matroid matching problem, the existence of a good characterization to the size of a maximum matching depends on the behavior of ...
Márton Makai, Gyula Pap, Jácint Szab...
CORR
2008
Springer
115views Education» more  CORR 2008»
15 years 6 months ago
Kolmogorov complexity in perspective
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...
Marie Ferbus-Zanda, Serge Grigorieff
CORR
2008
Springer
102views Education» more  CORR 2008»
15 years 6 months ago
On some deterministic dictionaries supporting sparsity
We describe a new construction of an incoherent dictionary, referred to as the oscillator dictionary, which is based on considerations in the representation theory of finite groups...
Shamgar Gurevich, Ronny Hadani, Nir A. Sochen
DM
2008
112views more  DM 2008»
15 years 6 months ago
On the vertices of the k-additive core
The core of a game v on N, which is the set of additive games dominating v such that (N) = v(N), is a central notion in cooperative game theory, decision making and in combinator...
Michel Grabisch, Pedro Miranda