Titlebook: Computer Science -- Theory and Applications; 10th International C Lev D. Beklemishev,Daniil V. Musatov Conference proceedings 2015 Springer

interleukins

書(shū)目名稱Computer Science -- Theory and Applications影響因子(影響力)




書(shū)目名稱Computer Science -- Theory and Applications影響因子(影響力)學(xué)科排名




書(shū)目名稱Computer Science -- Theory and Applications網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Computer Science -- Theory and Applications網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Computer Science -- Theory and Applications被引頻次




書(shū)目名稱Computer Science -- Theory and Applications被引頻次學(xué)科排名




書(shū)目名稱Computer Science -- Theory and Applications年度引用




書(shū)目名稱Computer Science -- Theory and Applications年度引用學(xué)科排名




書(shū)目名稱Computer Science -- Theory and Applications讀者反饋




書(shū)目名稱Computer Science -- Theory and Applications讀者反饋學(xué)科排名

無(wú)表情

,-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

Tonometry

無(wú)所不知

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

體貼

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

體貼

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

Peristalsis

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