Sciweavers

3145 search results - page 257 / 629
» Algebraic Linear Orderings
Sort
View
CORR
2007
Springer
82views Education» more  CORR 2007»
15 years 6 months ago
Programs as polygraphs: computability and complexity
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
Guillaume Bonfante, Yves Guiraud
CORR
2007
Springer
96views Education» more  CORR 2007»
15 years 6 months ago
Non-linear estimation is easy
Abstract: Non-linear state estimation and some related topics, like parametric estimation, fault diagnosis, and perturbation attenuation, are tackled here via a new methodology in ...
Michel Fliess, Cédric Join, Hebertt Sira-Ra...
JCT
2006
69views more  JCT 2006»
15 years 6 months ago
The Bergman complex of a matroid and phylogenetic trees
We study the Bergman complex B(M) of a matroid M: a polyhedral complex which arises in algebraic geometry, but which we describe purely combinatorially. We prove that a natural su...
Federico Ardila, Caroline J. Klivans
NA
2010
235views more  NA 2010»
15 years 1 months ago
On new iterative method for solving systems of nonlinear equations
Solving systems of nonlinear equations is a relatively complicated problem for which a number of different approaches have been proposed. In this paper, we employ the Homotopy Anal...
Fadi Awawdeh
ISSAC
2009
Springer
147views Mathematics» more  ISSAC 2009»
16 years 1 months ago
Fast algorithms for differential equations in positive characteristic
We address complexity issues for linear differential equations in characteristic p > 0: resolution and computation of the p-curvature. For these tasks, our main focus is on al...
Alin Bostan, Éric Schost