Titlebook: Computer Science – Theory and Applications; 6th International Co Alexander Kulikov,Nikolay Vereshchagin Conference proceedings 2011 Springe

Lensometer

書(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é)科排名

Truculent

Communicate

Sediment and the phosphate cycle,implicit problem. First we present optimal and near-optimal structures for paths and trees. Then, based on these results, we provide efficient structures for planar graphs and general directed graphs.

符合規(guī)定

Pseudo-random Graphs and Bit Probe Schemes with One-Sided Error,e main storage of .(.log..) bits and a short word of log.. bits that is pre-computed once for the stored set . and “cached”. To answer a query “.?∈?.?” we allow to read the whole cached word and only one bit from the main storage. For some reasonable values of parameters (e.g., for poly(log.)???.???

ONYM

,The Complexity of Inversion of Explicit Goldreich’s Function by DPLL Algorithms,with nonlinear . and random .. All above lower bounds are randomized..The main contribution of this paper is the simpler proof of the exponential lower bound of the Goldreich’s function inversion by myopic DPLL algorithms. A dependency graph in our construction may be based on an arbitrary expander,

Cacophonous

Cacophonous

Sediment and the phosphate cycle,n give a polynomial time characterisation of Maltsev digraphs admitting a conservative 2-semilattice operation. Finally, we give a simple inductive construction of directed acyclic digraphs preserved by a Maltsev operation.

dandruff

JOT

On Maltsev Digraphs,n give a polynomial time characterisation of Maltsev digraphs admitting a conservative 2-semilattice operation. Finally, we give a simple inductive construction of directed acyclic digraphs preserved by a Maltsev operation.

確定無(wú)疑

Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Cliqueidth of large path powers in polynomial time, which has been an open problem for a decade. The presented new characterisation is used to achieve this latter result. With our result, large .-path powers constitute the first non-trivial infinite class of graphs of unbounded clique-width whose clique-width can be computed exactly in polynomial time.