maroon
发表于 2025-3-28 15:35:54
Parameterized Aspects of Distinct Kemeny Rank Aggregationtional task of finding a Kemeny ranking has been studied under the lens of parameterized complexity with respect to many parameters. We study the parameterized complexity of the problem of computing all distinct Kemeny rankings. We consider the target Kemeny score, number of candidates, average dist
Ancillary
发表于 2025-3-28 19:19:54
http://reply.papertrans.cn/16/1532/153168/153168_42.png
concise
发表于 2025-3-29 00:40:19
http://reply.papertrans.cn/16/1532/153168/153168_43.png
geometrician
发表于 2025-3-29 06:16:24
On Query Complexity Measures and Their Relations for Symmetric Functionsial and adversary method. There have been considerable efforts to give lower bounds using these methods, and to compare/relate them with other measures based on the decision tree..We explore the value of these lower bounds on quantum query complexity and their relation with other decision tree based
Isometric
发表于 2025-3-29 07:16:49
http://reply.papertrans.cn/16/1532/153168/153168_45.png
cartilage
发表于 2025-3-29 14:25:41
http://reply.papertrans.cn/16/1532/153168/153168_46.png
接合
发表于 2025-3-29 15:51:12
http://reply.papertrans.cn/16/1532/153168/153168_47.png
archetype
发表于 2025-3-29 20:26:48
Semi-total Domination in Unit Disk GraphsA set . is said to be a semi-total dominating set if (.) . is a dominating set, and (.) for every vertex ., there exists a vertex . such that the distance between . and . in . is within 2. Given a graph ., the semi-total domination problem is to find a semi-total dominating set of minimum cardinalit
Madrigal
发表于 2025-3-30 02:54:27
http://reply.papertrans.cn/16/1532/153168/153168_49.png
搜集
发表于 2025-3-30 06:04:49
Unique Least Common Ancestors and Clusters in Directed Acyclic Graphsing unique least common ancestors for certain subsets of their minimal elements since these are of interest, particularly as models of phylogenetic networks. Here, we use the close connection between the canonical .-ary transit function and the closure function on a set system to show that pre-.-ary