2612 search results - page 340 / 523 » Switching Graphs and Their Complexity |
154
click to vote
CAV
2008
Springer
15 years 6 months ago
2008
Springer
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
148
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...
143
click to vote
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
—Recently proposed beaconless georouting algorithms are fully reactive, with nodes forwarding packets without prior knowledge of their neighbors. However, existing approaches for...
155
click to vote
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
208
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Several tools have been developed to explore and search Gene Ontology (GO) databases allowing efficient GO enrichment analysis and GO tree visualization. Nevertheless,...