1695 search results - page 23 / 339 » Linear, Polynomial or Exponential |
120
click to vote
ICFP
2007
ACM
16 years 19 days ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
CORR
2008
Springer
15 years 23 days ago
2008
Springer
Abstract. We study the succinctness of the complement and intersection of regular expressions. In particular, we show that when constructing a regular expression defining the compl...
108
Voted
FOCS
1992
IEEE
15 years 4 months ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
94
Voted
TIT
2008
15 years 17 days ago
2008
If and are nonnegative integers and F is a field, then a polynomial collection {p1, . . . , p} Z[1, . . . , ] is said to be solvable over F if there exist 1, . . . , F such t...
115
click to vote
HYBRID
2010
Springer
15 years 5 months ago
2010
Springer
Exponential stability of switched linear systems under both arbitrary and proper switching is studied through two suitably defined families of functions called the strong and the...