Titlebook: Mathematical Foundations of Computer Science 2014; 39th International S Erzsébet Csuhaj-Varjú,Martin Dietzfelbinger,Zoltán Conference proce

Recovery

書目名稱Mathematical Foundations of Computer Science 2014影響因子(影響力)




書目名稱Mathematical Foundations of Computer Science 2014影響因子(影響力)學(xué)科排名




書目名稱Mathematical Foundations of Computer Science 2014網(wǎng)絡(luò)公開度




書目名稱Mathematical Foundations of Computer Science 2014網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Mathematical Foundations of Computer Science 2014被引頻次




書目名稱Mathematical Foundations of Computer Science 2014被引頻次學(xué)科排名




書目名稱Mathematical Foundations of Computer Science 2014年度引用




書目名稱Mathematical Foundations of Computer Science 2014年度引用學(xué)科排名




書目名稱Mathematical Foundations of Computer Science 2014讀者反饋




書目名稱Mathematical Foundations of Computer Science 2014讀者反饋學(xué)科排名

FOLD

Marcello M. Bersani,Matteo Rossi,Pierluigi San Pietro

gonioscopy

Arturo Carpi,Gabriele Fici,?těpán Holub,Jakub Opr?al,Marinella Sciortino

碳水化合物

粗魯性質(zhì)

Julien Cassaigne,Gabriele Fici,Marinella Sciortino,Luca Q. Zamboni

ARM

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 ob

Nomadic

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).

悶熱

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 existenti

dissolution

睨視