29908 search results - page 421 / 5982 » On the Complexity of |
167
click to vote
COCO
2005
Springer
16 years 15 days ago
2005
Springer
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...
225
click to vote
FSTTCS
2005
Springer
16 years 14 days ago
2005
Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
151
click to vote
ICALP
2005
Springer
16 years 14 days ago
2005
Springer
Abstract. This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dil...
204
Voted
ICNC
2005
Springer
16 years 14 days ago
2005
Springer
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...
197
click to vote
MICAI
2005
Springer
16 years 13 days ago
2005
Springer
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...