Sciweavers

1695 search results - page 48 / 339
» Linear, Polynomial or Exponential
Sort
View
APLAS
2005
ACM
15 years 9 months ago
Transformation to Dynamic Single Assignment Using a Simple Data Flow Analysis
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
Peter Vanbroekhoven, Gerda Janssens, Maurice Bruyn...
SIAMCO
2011
14 years 11 months ago
Converse Lyapunov Theorems for Switched Systems in Banach and Hilbert Spaces
Abstract. We consider switched systems on Banach and Hilbert spaces governed by strongly continuous one-parameter semigroups of linear evolution operators. We provide necessary and...
Falk M. Hante, Mario Sigalotti
ISSAC
1997
Springer
102views Mathematics» more  ISSAC 1997»
15 years 8 months ago
A Numerical Absolute Primality Test for Bivariate Polynomials
We give a new numerical absolute primality criterion for bivariate polynomials. This test is based on a simple property of the monomials appearing after a generic linear change of...
André Galligo, Stephen M. Watt
JCT
2000
103views more  JCT 2000»
15 years 3 months ago
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
Alexander Schrijver
CORR
2008
Springer
80views Education» more  CORR 2008»
15 years 4 months ago
A Dual Polynomial for OR
We reprove that the approximate degree of the OR function on n bits is ( n). We consider a linear program which is feasible if and only if there is an approximate polynomial for ...
Robert Spalek