3208 search results - page 294 / 642 » A Lower Bound for Primality |
156
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...
167
click to vote
ASPDAC
1995
ACM
15 years 10 months ago
1995
ACM
In this article a scheduling method is presented which is capable of allocating supplementary resources during scheduling. This makes it very suitable in synthesis strategies base...
155
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...
199
click to vote
COMPGEOM
1995
ACM
15 years 10 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
206
click to vote
ISLPED
1997
ACM
15 years 10 months ago
1997
ACM
New measures of peak power in the context of sequential circuits are proposed. This paper presents an automatic procedure to obtain very good lower bounds on these measures as wel...