搜索结果: 1-2 共查到“物理学 Graph Properties”相关记录2条 . 查询时间(0.062 秒)
Quantum query complexity of minor-closed graph properties
Quantum query minor-closed graph properties
2010/11/8
We study the quantum query complexity of minor-closed graph properties, which include such problems as determining whether a graph is planar, is a forest, or does not contain a path of a given length....
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go.
Graph Properties Circular Functions Quantum Query
2012/11/29
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity.That is, for a permutation group Γ, how low can the complexity be for any boolean fu...
