interleukins
发表于 2025-3-21 16:59:52
书目名称Computer Science -- Theory and Applications影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0233755<br><br> <br><br>书目名称Computer Science -- Theory and Applications影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0233755<br><br> <br><br>书目名称Computer Science -- Theory and Applications网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0233755<br><br> <br><br>书目名称Computer Science -- Theory and Applications网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0233755<br><br> <br><br>书目名称Computer Science -- Theory and Applications被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0233755<br><br> <br><br>书目名称Computer Science -- Theory and Applications被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0233755<br><br> <br><br>书目名称Computer Science -- Theory and Applications年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0233755<br><br> <br><br>书目名称Computer Science -- Theory and Applications年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0233755<br><br> <br><br>书目名称Computer Science -- Theory and Applications读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0233755<br><br> <br><br>书目名称Computer Science -- Theory and Applications读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0233755<br><br> <br><br>
无表情
发表于 2025-3-21 23:16:02
,-Completeness and Universal Hardness Results for Justification Logic,rom our previous work is tight. We then use a simple modification of the corresponding reduction to prove that satisfiability for all multi-agent justification logics from there is .-hard – given certain reasonable conditions. Our methods improve on these required conditions for the same lower bound
Abominate
发表于 2025-3-22 01:24:26
http://reply.papertrans.cn/24/2338/233755/233755_3.png
Tonometry
发表于 2025-3-22 05:03:05
http://reply.papertrans.cn/24/2338/233755/233755_4.png
无所不知
发表于 2025-3-22 09:06:35
On Compiling Structured CNFs to OBDDs,t is, formulas with incidence graphs that are convex with respect to the set of variables) have polynomial OBDD size. Second, we prove an exponential lower bound on the OBDD size of a family of CNF formulas with incidence graphs of bounded degree..We obtain the first result by identifying a simple s
体贴
发表于 2025-3-22 13:46:11
Satisfiability of ECTL* with Tree Constraints, the bounding quantifier (.). Here we apply this approach to concrete domains that are tree-like. We show that satisfiability of . with constraints is decidable over (i) semi-linear orders, (ii) ordinal trees (semi-linear orders where the branches form ordinals), and (iii) infinitely branching order
体贴
发表于 2025-3-22 19:00:42
On Growth and Fluctuation of ,-Abelian Complexity,ticular aspects of this extension: First, how much the complexity can increase when moving from a level . to the next one. Second, how much the complexity of a given word can fluctuate. For both questions we give optimal solutions.
Incumbent
发表于 2025-3-23 00:53:37
http://reply.papertrans.cn/24/2338/233755/233755_8.png
Peristalsis
发表于 2025-3-23 01:56:56
Editing to a Planar Graph of Given Degrees, ., together with three integers ., . and .. The question is whether we can delete a set of vertices of total weight at most . and a set of edges of total weight at most . so that the total cost of the deleted elements is at most . and every non-deleted vertex . has degree . in the resulting graph .
optic-nerve
发表于 2025-3-23 07:30:28
http://reply.papertrans.cn/24/2338/233755/233755_10.png