Titlebook: Computer Science -- Theory and Applications; 7th International Co Edward A. Hirsch,Juhani Karhumäki,Michail Prilutsk Conference proceedings

Antigen

大方一点

https://doi.org/10.1007/978-1-4615-2952-1can be solved in linear time on block graphs. For general graphs the best known algorithm runs in time .. For trees and interval graphs, linear-time algorithms are known. As block graphs form a superclass of trees, our result extends the classes of graphs on which this problem is solvable in linear time.

N防腐剂

Mortal

Broadcast Domination on Block Graphs in Linear Timecan be solved in linear time on block graphs. For general graphs the best known algorithm runs in time .. For trees and interval graphs, linear-time algorithms are known. As block graphs form a superclass of trees, our result extends the classes of graphs on which this problem is solvable in linear time.

单片眼镜

Descriptional Complexity of Operations on Alternating and Boolean Automataerations on languages represented by boolean and alternating finite automata. We get tight bounds for intersection and union, and for concatenation and reversal of languages represented by boolean automata. In the case of star, and of concatenation and reversal of AFA languages, our upper and lower bounds differ by one.

没有准备

Checking Tests for Read-Once Functions over Arbitrary Basesriables of . and . is the largest arity of functions in .. For some functions, this bound cannot be improved by more than a constant factor. The employed technique involves reconstructing . from its .-variable projections and provides a stronger form of Kuznetsov’s classic theorem on read-once representations.

STENT

JEER

Satisfiability Thresholds beyond , −XORSATver a domain of 4 elements with . = 3 arguments..The proof is based on variance calculations, using a technique introduced by Dubois/Mandler. However, several additional observations (of independent interest) are necessary.

inferno

Dictation

https://doi.org/10.1007/978-3-662-13150-3ntennae)..2) We present novel upper bound techniques which, in combination with stronger lower bounds, allow us to improve the previous approximation results for the edge length needed to achieve strong connectivity for . = 4 (from 2sin(./5) to optimal) and . = 3 (from . to .).