13603 search results - page 83 / 2721 » On the Computational Complexity of Cut-Reduction |
177
click to vote
ECOOPW
1999
Springer
15 years 10 months ago
1999
Springer
Impact analysis is seen as an important technique for controlling the evolution of software systems. Numerous approaches have been proposed which aim to assess the impact of chang...
132
click to vote
MFCS
1993
Springer
15 years 10 months ago
1993
Springer
We prove (for fixed k) that at least 1 k−1 (n 2 ) − O(n) equality tests and no more than 2 k (n 2 )+O(n) equality tests are needed in the worst case to determine whether a giv...
243
click to vote
GI
2007
Springer
15 years 9 months ago
2007
Springer
Abstract: Modeling systems with Statecharts has become standard practice in the design of reactive embedded devices. However, the modeling of realistic applications with the paradi...
130
click to vote
JC
2006
15 years 5 months ago
2006
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
175
click to vote
AUTOMATICA
1999
15 years 5 months ago
1999
In this paper, we consider simple classes of nonlinear systems and prove that basic questions related to their stability and controllability are either undecidable or computationa...