Titlebook: Computing and Combinatorics; 27th International C Chi-Yeh Chen,Wing-Kai Hon,Chia-Wei Lee Conference proceedings 2021 Springer Nature Switze

stress-response

Hardness and Approximation Results of Roman {3}-Domination in Graphsn . and if ., then .. The weight, .(.), of a Roman {3}-dominating function . is .. The minimum weight of a Roman .-dominating function in a graph . is known as . .-. of . and is denoted by .. . .-. problem is to find a Roman .-dominating function of minimum weight and . .-. is the decision version o

松紧带

繁忙

mediocrity

领先

Sequence Graphs Realizations and Ambiguity in Language Modelsnt baselines. Sequence graphs are the natural structures encoding their information. However, a sequence graph may have several realizations as a sequence, leading to a degree of ambiguity. In this paper, we study such degree of ambiguity from a combinatorial and computational point of view. In part

捕鲸鱼叉

Between SC and LOGDCFL: Families of Languages Accepted by Polynomial-Time Logarithmic-Space Determindied in depth from an aspect of parallel computability because it is nicely situated between . and .. By changing a memory device from pushdown stacks to access-controlled storage tapes, we introduce a computational model of deterministic depth-. storage automata (.-sda’s) whose tape cells are freel

飓风

Ideal Separation and General Theorems for Constrained Synchronization and Their Application to Small show that intersecting a given constraint language with an ideal language does not increase the computational complexity. Additionally, we state a theorem giving .-hardness that broadly generalizes previously used constructions and a result on how to combine languages by concatenation to get polyno

Preserve

oracle

Conference proceedings 2021tober 2021...Due to the COVID-19 pandemic, COCOON 2021 was organized as a hybrid conference. ..The 56 papers presented in this volume were carefully reviewed and selected from 131 submissions. The papers are divided into the following topical sub-headings: algorithms, approximation algorithms, autom

燕麦