Titlebook: Algorithms and Computation; 24th International S Leizhen Cai,Siu-Wing Cheng,Tak-Wah Lam Conference proceedings 2013 Springer-Verlag Berlin

Harding

书目名称Algorithms and Computation影响因子(影响力)




书目名称Algorithms and Computation影响因子(影响力)学科排名




书目名称Algorithms and Computation网络公开度




书目名称Algorithms and Computation网络公开度学科排名




书目名称Algorithms and Computation被引频次




书目名称Algorithms and Computation被引频次学科排名




书目名称Algorithms and Computation年度引用




书目名称Algorithms and Computation年度引用学科排名




书目名称Algorithms and Computation读者反馈




书目名称Algorithms and Computation读者反馈学科排名

慢跑鞋

orthodox

商业上

惊惶

majestic

Determinantal Complexities and Field Extensions. We also consider additive constant gaps: (1) there exists a quadratic polynomial . ∈ ℚ[., .], such that ..(.) = 3 and .; (2) there exists a cubic polynomial . ∈ ℚ[., .] with a rational zero, such that ..(.) = 4 and .. For additive constant gaps, geometric criteria are presented to decide when ..

inveigh

Yag-Capsulotomy

On Determining Deep Holes of Generalized Reed-Solomon Codese classify deep holes completely for generalized Reed-Solomon codes .. (.,.), where . is a prime, .. Our techniques are built on the idea of deep hole trees, and several results concerning the Erdös-Heilbronn conjecture.

metropolitan

The Complexity of Finding a Large Subgraph under Anonymity Constraintsther graph classes (like threshold graphs), and thereby establish a sharp borderline between hard and easy cases of the problem. Finally we perform a parametrized analysis, and we concisely characterize combinations of natural parameters that allow FPT algorithms.

巩固

Hardness and Algorithms for Variants of Line Graphs of Directed Graphs easy to recognize when the underlying graph is triangle-free. We also determine the complexity of the vertex coloring, the stable set and the facility location problem for triangle-free facility location graphs.