5100 search results - page 147 / 1020 » The Linear Complexity of a Graph |
POPL
2009
ACM
14 years 10 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
ICFP
2007
ACM
14 years 9 months 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 ...
ISCAS
1999
IEEE
14 years 1 months ago
1999
IEEE
Traditional approaches to channel equalization are based on the inversion of the global (linear or nonlinear) channel response. However, in digital links the complete channel inve...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We show that the Parikh image of the language of an NFA with n states over an alphabet of size k can be described as a finite union of linear sets with at most k generators and to...
ORL
1998
13 years 9 months ago
1998
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...