2661 search results - page 461 / 533 » Quantum Complexity Classes |
109
click to vote
CORR
1999
Springer
15 years 2 months ago
1999
Springer
: In the early 1980s, Selman's seminal work on positive Turing reductions showed that positive Turing reduction to NP yields no greater computational power than NP itself. Thu...
133
click to vote
TSE
2002
15 years 2 months ago
2002
A number of papers have investigated the relationships between design metrics and the detection of faults in object-oriented software. Several of these studies have shown that suc...
132
click to vote
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
137
click to vote
OOPSLA
2010
Springer
15 years 1 months ago
2010
Springer
As software becomes increasingly complex and difficult to analyze, it is more and more common for developers to use high-level, type-safe, object-oriented (OO) programming langua...
161
click to vote
HIPC
2009
Springer
15 years 27 days ago
2009
Springer
Stream computing research is moving from terascale to petascale levels. It aims to rapidly analyze data as it streams in from many sources and make decisions with high speed and a...