1132 search results - page 127 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
186
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
We propose the recursive grid layout scheme for deriving efficient layouts of a variety of hierarchical networks and computing upper bounds on the VLSI area of general hierarchica...
152
click to vote
FOSSACS
2006
Springer
15 years 10 months ago
2006
Springer
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan...
149
click to vote
STACS
2000
Springer
15 years 10 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
184
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
In some application domains, such as medical imaging, the objects that compose the scene are known as well as some of their properties and their spatial arrangement. We can take ad...
147
click to vote
FM
2008
Springer
15 years 8 months ago
2008
Springer
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...