6142 search results - page 509 / 1229 » The Complexity of Partition Functions |
162
click to vote
IFL
2003
Springer
16 years 4 days ago
2003
Springer
Construction of complex array operations by composition of more basic ones allows for abstract and concise specifications of algorithms. Unfortunately, na¨ıve compilation of suc...
176
click to vote
ESOP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. It is well-known that context-independent control flow analysis can be performed in cubic time for functional and object-oriented languages. Yet recent applications of c...
174
click to vote
ICCAD
1997
IEEE
15 years 11 months ago
1997
IEEE
We present a novel method for state minimization of incompletely-specified finite state machines. Where classic methods simply minimize the number of states, ours directly addre...
178
click to vote
DAC
1997
ACM
15 years 11 months ago
1997
ACM
Novel test bench techniques are required to cope with a functional test complexity which is predicted to grow much more strongly than design complexity. Our test bench approach at...
179
click to vote
CRYPTO
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We consider the problem of random selection, where p players follow a protocol to jointly select a random element of a universe of size n. However, some of the players ma...