3172 search results - page 65 / 635 » On the Random-Self-Reducibility of Complete Sets |
128
click to vote
KBSE
2000
IEEE
15 years 4 months ago
2000
IEEE
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
118
Voted
FORTE
2003
15 years 2 months ago
2003
The aim of passive testing is to detect faults in a system while observing the system during normal operation, that is, without forcing the system to specialized inputs explicitly ...
115
click to vote
ALGORITHMICA
2002
15 years 18 days ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
152
Voted
QCQC
1998
Springer
15 years 5 months ago
1998
Springer
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classi...
106
Voted
BMCBI
2008
15 years 26 days ago
2008
Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...