Titlebook: Computer Science – Theory and Applications; 16th International C Rahul Santhanam,Daniil Musatov Conference proceedings 2021 Springer Nature

全面

Bit-Complexity of Solving Systems of Linear Evolutionary Partial Differential Equations,-value problem for a linear evolutionary system of PDEs is approximated up?to absolute error . by repeatedly (exponentially often in .) multiplying a matrix . to the vector from the previous time step, starting with the initial condition ., approximated by the spatial grid vector .. The dimension of

VEN

,A Secure Three-Input AND Protocol with?a?Standard Deck of Minimal Cards,xisting protocols use a two-colored deck consisting of red cards and black cards, Niemi and Renvall in 1999 constructed protocols for securely computing two-input Boolean functions (such as secure logical AND and XOR computations) using a commonly available standard deck of playing cards. Since this

削減

外來(lái)

,Predictions and Algorithmic Statistics for?Infinite Sequences,“explanation” for the observed data (in the sense of algorithmic statistics) for prediction. In this way we keep the expected sum of squares of prediction errors bounded (as it was for the Solomonoff’s predictor) and, moreover, guarantee that the sum of squares of prediction errors is bounded along

HEAVY

我還要背著他

Approximation Algorithms for Connectivity Augmentation Problems,he . problem we need to increase the edge-connectivity by?1. In the . problem . is connected and . should be 2-connected. In . problems every edge in . connects minimal deficient sets. For this version we give a simple combinatorial approximation algorithm with ratio 5/3, improving the 1.91 approxim

Irrigate

Pageant

0302-9743 une/July 2021...The 28 full papers were carefully reviewed and selected from 68 submissions. The papers cover a broad range of topics, such as formal languages and automata theory, geometry and discrete structures; theory and algorithms for application domains and much more. .978-3-030-79415-6978-3-

愚笨

連系

https://doi.org/10.1007/b113856red by a combinatorial characterisation of the determinant developed by Mahajan and Vinay (SODA 1997). We extend the combinatorial object in their work, namely ., by introducing additional edge labels on the edges of the underlying graph. The idea of using edge labels is inspired by the work of Mengel (MFCS 2013).