Recovery 发表于 2025-3-21 19:08:46
书目名称Mathematical Foundations of Computer Science 2014影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0626149<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 2014影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0626149<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 2014网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0626149<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 2014网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0626149<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 2014被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0626149<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 2014被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0626149<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 2014年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0626149<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 2014年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0626149<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 2014读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0626149<br><br> <br><br>书目名称Mathematical Foundations of Computer Science 2014读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0626149<br><br> <br><br>FOLD 发表于 2025-3-21 20:48:16
Marcello M. Bersani,Matteo Rossi,Pierluigi San Pietrogonioscopy 发表于 2025-3-22 02:42:16
Arturo Carpi,Gabriele Fici,Štěpán Holub,Jakub Opršal,Marinella Sciortino碳水化合物 发表于 2025-3-22 07:29:02
http://reply.papertrans.cn/63/6262/626149/626149_4.png粗鲁性质 发表于 2025-3-22 12:47:45
Julien Cassaigne,Gabriele Fici,Marinella Sciortino,Luca Q. ZamboniARM 发表于 2025-3-22 14:01:42
Partial-Observation Stochastic Reachability and Parity Gamesctions invisible), or (c) they may use full randomization. We consider all these classes of games with reachability, and parity objectives that can express all .-regular objectives. The analysis problems are classified into the . analysis that asks for the existence of a strategy that ensures the obNomadic 发表于 2025-3-22 20:55:48
What Does the Local Structure of a Planar Graph Tell Us About Its Global Structure?ea of Property Testing that leads to the following result (stated informally): There is a . = .(.,.) such that for any planar graph . its local structure (described by the frequency vector of .-disks) determines . up to insertion and deletion of at most .. edges (and relabelling of vertices).闷热 发表于 2025-3-22 21:56:56
Towards Efficient Reasoning Under Guarded-Based Disjunctive Existential Ruleser the main guarded-based classes of disjunctive existential rules..We show that (unions of) conjunctive queries of bounded hypertree-width and of bounded treewidth do not reduce the complexity of our problem, even if we focus on predicates of bounded arity, or on fixed sets of disjunctive existentidissolution 发表于 2025-3-23 02:42:11
http://reply.papertrans.cn/63/6262/626149/626149_9.png睨视 发表于 2025-3-23 08:39:21
http://reply.papertrans.cn/63/6262/626149/626149_10.png