Sciweavers

731 search results - page 79 / 147
» Reductions to Graph Isomorphism
Sort
View
SODA
2012
ACM
227views Algorithms» more  SODA 2012»
13 years 6 months ago
Improved output-sensitive quantum algorithms for Boolean matrix multiplication
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...
François Le Gall
160
Voted
SPIN
2000
Springer
15 years 7 months ago
Model Checking Based on Simultaneous Reachability Analysis
Abstract. Simultaneous reachability analysis SRA is a recently proposed approach to alleviating the state space explosion problem in reachability analysis of concurrent systems. Th...
Bengi Karaçali, Kuo-Chung Tai
123
Voted
JAIR
2008
123views more  JAIR 2008»
15 years 4 months ago
The Computational Complexity of Dominance and Consistency in CP-Nets
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
Judy Goldsmith, Jérôme Lang, Miroslaw...
121
Voted
WG
2005
Springer
15 years 9 months ago
Hypertree Decompositions: Structure, Algorithms, and Applications
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
Georg Gottlob, Martin Grohe, Nysret Musliu, Marko ...
236
Voted
BMCBI
2007
93views more  BMCBI 2007»
15 years 4 months ago
The topology of metabolic isotope labeling networks
Background: Metabolic Flux Analysis (MFA) based on isotope labeling experiments (ILEs) is a widely established tool for determining fluxes in metabolic pathways. Isotope labeling ...
Michael Weitzel, Wolfgang Wiechert, Katharina N&ou...