Harding
发表于 2025-3-21 17:25:50
书目名称Algorithms and Computation影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0153137<br><br> <br><br>书目名称Algorithms and Computation影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0153137<br><br> <br><br>书目名称Algorithms and Computation网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0153137<br><br> <br><br>书目名称Algorithms and Computation网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0153137<br><br> <br><br>书目名称Algorithms and Computation被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0153137<br><br> <br><br>书目名称Algorithms and Computation被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0153137<br><br> <br><br>书目名称Algorithms and Computation年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0153137<br><br> <br><br>书目名称Algorithms and Computation年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0153137<br><br> <br><br>书目名称Algorithms and Computation读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0153137<br><br> <br><br>书目名称Algorithms and Computation读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0153137<br><br> <br><br>
慢跑鞋
发表于 2025-3-21 21:40:37
http://reply.papertrans.cn/16/1532/153137/153137_2.png
orthodox
发表于 2025-3-22 01:11:46
http://reply.papertrans.cn/16/1532/153137/153137_3.png
商业上
发表于 2025-3-22 05:33:04
http://reply.papertrans.cn/16/1532/153137/153137_4.png
惊惶
发表于 2025-3-22 09:53:36
http://reply.papertrans.cn/16/1532/153137/153137_5.png
majestic
发表于 2025-3-22 14:40:01
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
发表于 2025-3-22 19:33:06
http://reply.papertrans.cn/16/1532/153137/153137_7.png
Yag-Capsulotomy
发表于 2025-3-22 22:39:03
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
发表于 2025-3-23 05:12:23
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.
巩固
发表于 2025-3-23 09:06:50
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.