標題: Titlebook: Computing and Combinatorics; 17th Annual Internat Bin Fu,Ding-Zhu Du Conference proceedings 2011 Springer-Verlag GmbH Berlin Heidelberg 201 [打印本頁] 作者: deteriorate 時間: 2025-3-21 19:12
書目名稱Computing and Combinatorics影響因子(影響力)
書目名稱Computing and Combinatorics影響因子(影響力)學科排名
書目名稱Computing and Combinatorics網(wǎng)絡公開度
書目名稱Computing and Combinatorics網(wǎng)絡公開度學科排名
書目名稱Computing and Combinatorics被引頻次
書目名稱Computing and Combinatorics被引頻次學科排名
書目名稱Computing and Combinatorics年度引用
書目名稱Computing and Combinatorics年度引用學科排名
書目名稱Computing and Combinatorics讀者反饋
書目名稱Computing and Combinatorics讀者反饋學科排名
作者: 顯示 時間: 2025-3-21 21:21
Viscosity Phenomena in a Magnetic Field, a heuristic to search for a minimum set of 0/1-flips such that the resulting matrix admits a directed perfect phylogeny. We then extend our approach by using edge weights to weight the columns of the 0/1/?-matrix..In our evaluation, we show that our method is extremely swift in practice, and orders作者: AER 時間: 2025-3-22 02:07 作者: 著名 時間: 2025-3-22 07:13 作者: EWER 時間: 2025-3-22 10:27 作者: AXIS 時間: 2025-3-22 13:58 作者: AXIS 時間: 2025-3-22 20:17
Quantum Algorithm for the Boolean Hidden Shift Problem,exity of the algorithm is polynomial. Based on this we show an average case exponential separation between classical and quantum time complexity. A perhaps interesting aspect of this work is that, while the extremal case of the Boolean hidden shift problem over so-called bent functions can be reduce作者: Detonate 時間: 2025-3-22 22:33 作者: insomnia 時間: 2025-3-23 03:56 作者: 自負的人 時間: 2025-3-23 09:20 作者: cravat 時間: 2025-3-23 12:46 作者: 鴿子 時間: 2025-3-23 16:01 作者: 巧辦法 時間: 2025-3-23 18:46
,A Kolmogorov Complexity Proof of the Lovász Local Lemma for Satisfiability,Recently, Moser and Tardos?[MT10] came up with a . proof of the Lovász Local Lemma. In this paper, we give another constructive proof of the lemma, based on Kolmogorov complexity. Actually, we even improve the Local Lemma slightly.作者: musicologist 時間: 2025-3-24 01:39
Computing and Combinatorics978-3-642-22685-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: MEET 時間: 2025-3-24 02:22
Hans Dieter Baehr,Stephan Kabelacnal complexity of this problem was open in the past. In this paper, we show that this problem is NP-hard, and present a parameterized algorithm based on a refined search tree technique with a running time of .(4.612.?+?|.|.)), which improves the trivial algorithm of running time .(6.?+?|.|.).作者: helper-T-cells 時間: 2025-3-24 10:10 作者: ASTER 時間: 2025-3-24 14:05 作者: 現(xiàn)暈光 時間: 2025-3-24 16:23
Bin Fu,Ding-Zhu DuUp-to-date results.Fast-track conference proceedings.State-of-the-art research作者: 貪婪性 時間: 2025-3-24 22:00
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/234771.jpg作者: Pde5-Inhibitors 時間: 2025-3-25 02:44
Diffusion and Thermodiffusion in Alloys,ynomial-time algorithms to count the number of dominating sets (and minimum dominating sets) in interval graphs and trapezoid graphs. They are based on dynamic programming. With the help of dynamic update on a binary tree, we further reduce the time complexity. On the other hand, we prove that count作者: Perennial長期的 時間: 2025-3-25 05:32
The Phenomenological Relations,n a . graph .?=?(.,.) with edge weights ..?∈?? and edge lengths ?.?∈?? for .?∈?. we define the density of a . subgraph .?=?(.′,.′)???. as the ratio .. We consider the problem of computing a maximum density pattern . with weight at least . and and length at most . in a host ...We consider this proble作者: 1FAWN 時間: 2025-3-25 11:10
Viscosity Phenomena in a Magnetic Field,erent ways, to cope with contradictory information in the input. In particular, there exist methods based on encoding the input trees in a matrix, and methods based on finding minimum cuts in some graph. Matrix representation methods compute supertrees of superior quality, but the underlying optimiz作者: 蔑視 時間: 2025-3-25 13:02
Diffusion and Thermodiffusion in Alloys,ems. This paper presents new local search methods to solve the maximum satisfiability problems and analyzes the performance of the methods. We focus on the sub problem with each clause containing at least . literals, Max-(.)-Sat briefly. The central issue is to discuss the local search algorithms as作者: Concomitant 時間: 2025-3-25 16:41 作者: Truculent 時間: 2025-3-25 21:03 作者: 巨大沒有 時間: 2025-3-26 04:13 作者: 組成 時間: 2025-3-26 04:39 作者: 來這真柔軟 時間: 2025-3-26 09:22
Der 2. Hauptsatz der Thermodynamik,n made in the study of counting constraint satisfaction problems (or simply #CSPs). In particular, a computational complexity classification of bounded-degree #CSPs has been discovered for all degrees except for two, where the . of an instance is the maximal number of times that each input variable 作者: preeclampsia 時間: 2025-3-26 16:13 作者: Mitigate 時間: 2025-3-26 17:25
Der 1. Hauptsatz der Thermodynamik, ., and prove a dichotomy theorem for the following class of problems, specified by . and .: Given an arbitrary .-regular graph .?=?(., .), where each edge is attached the function ., compute .(.)?=?∑?.?∏?.. (.(.), .(.)). .(·) is known as the partition function of the ., also known as graph homomorp作者: Baffle 時間: 2025-3-27 00:29
,Mengenma?e, Einheiten, Stoffdaten,blem is its flexibility, since it can be defined for a whole range of functions and a whole range of underlying groups. In a way, this distinguishes it from the hidden subgroup problem where more stringent requirements about the existence of a periodic subgroup have to be made. And yet, the hidden s作者: 的事物 時間: 2025-3-27 04:37 作者: Inferior 時間: 2025-3-27 07:52
https://doi.org/10.1007/3-540-32514-Xligned squares model is used to represent imprecise input data. If squares are non-overlapping and of different sizes, the time complexity of the best known algorithm is .(..). If squares are allowed to overlap but have the same size, the time complexity of the best known algorithm is .(..). In this作者: 冷淡一切 時間: 2025-3-27 12:00
Der 1. Hauptsatz der Thermodynamik,estion whether there exists a straight-line drawing of . such that each vertex is represented as a distinct point of . as well as to provide an embedding if one does exist. Recently, in?[15], a complete characterization for this problem on a special class of graphs known as the plane 3-trees was pre作者: Lime石灰 時間: 2025-3-27 13:50 作者: 輕率的你 時間: 2025-3-27 19:35
Cograph Editing: Complexity and Parameterized Algorithms,nal complexity of this problem was open in the past. In this paper, we show that this problem is NP-hard, and present a parameterized algorithm based on a refined search tree technique with a running time of .(4.612.?+?|.|.)), which improves the trivial algorithm of running time .(6.?+?|.|.).作者: 愚蠢人 時間: 2025-3-28 01:04
Dominating Set Counting in Graph Classes,ynomial-time algorithms to count the number of dominating sets (and minimum dominating sets) in interval graphs and trapezoid graphs. They are based on dynamic programming. With the help of dynamic update on a binary tree, we further reduce the time complexity. On the other hand, we prove that count作者: AGOG 時間: 2025-3-28 03:21
The Density Maximization Problem in Graphs,n a . graph .?=?(.,.) with edge weights ..?∈?? and edge lengths ?.?∈?? for .?∈?. we define the density of a . subgraph .?=?(.′,.′)???. as the ratio .. We consider the problem of computing a maximum density pattern . with weight at least . and and length at most . in a host ...We consider this proble作者: 喃喃訴苦 時間: 2025-3-28 07:41
FlipCut Supertrees: Towards Matrix Representation Accuracy in Polynomial Time,erent ways, to cope with contradictory information in the input. In particular, there exist methods based on encoding the input trees in a matrix, and methods based on finding minimum cuts in some graph. Matrix representation methods compute supertrees of superior quality, but the underlying optimiz作者: 地名詞典 時間: 2025-3-28 14:08 作者: Resection 時間: 2025-3-28 14:37 作者: Osteoporosis 時間: 2025-3-28 20:55
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms, rainbow connected if every two vertices of . has a path in which all edges are assigned distinct colors. Chakraborty .. defined the problem of determining whether the graph colored by a given edge-coloring is rainbow connected. Chen .. introduced the vertex-coloring version of the problem as a vari作者: Bombast 時間: 2025-3-29 01:50
On Parameterized Independent Feedback Vertex Set,iant of the FVS problem and is defined as follows: given a graph . and an integer ., decide whether there exists .???.(.), |.|?≤?., such that .[.(.)???.] is a forest and .[.] is an independent set; the parameter is .. Note that the similarly parameterized versions of the FVS problem — where there is作者: 補充 時間: 2025-3-29 06:12 作者: offense 時間: 2025-3-29 07:33 作者: 愛了嗎 時間: 2025-3-29 15:02
Strong I/O Lower Bounds for Binomial and FFT Computation Graphs,sary to design algorithms that minimize I/O traffic to slower memories in the hierarchy. In this paper, we propose a new technique, ., for deriving lower bounds on the memory traffic complexity of problems in a two-level memory hierarchy architectures. The boundary flow technique relies on identifyi作者: CLOT 時間: 2025-3-29 15:40 作者: 駭人 時間: 2025-3-29 22:42 作者: 阻礙 時間: 2025-3-30 02:34
,Proper ,-Cell Polycubes in ,???3 Dimensions, of polycubes, and, in particular, specific types of polycubes, as well as computing the asymptotic growth rate of polycubes, is a popular problem in discrete geometry. This is also an important tool in statistical physics for computations related to percolation processes and branched polymers. In t作者: AER 時間: 2025-3-30 05:39 作者: 異常 時間: 2025-3-30 08:13
Improved Algorithms for the Point-Set Embeddability Problem for Plane 3-Trees,estion whether there exists a straight-line drawing of . such that each vertex is represented as a distinct point of . as well as to provide an embedding if one does exist. Recently, in?[15], a complete characterization for this problem on a special class of graphs known as the plane 3-trees was pre作者: THE 時間: 2025-3-30 13:59
Optimal Strategies for the One-Round Discrete Voronoi Game on a Line,es a set . of . facilities following which P2 chooses another set . of . facilities, disjoint from ., where .?=?.(1) is a positive constant. The payoff of a player . is defined as the cardinality of the set of points in . which are closer to a point in . than to every point in ., for .?≠?.. The obje作者: critique 時間: 2025-3-30 16:42 作者: 過去分詞 時間: 2025-3-30 23:30 作者: AUGER 時間: 2025-3-31 01:11
Advances in Physical Geochemistrytly carries over to FVSA. We show that IFVS can be solved in time .(5...) time where . is the number of vertices in the input graph ., and obtain a cubic (.(..)) kernel for the problem. Note the contrast with the CFVS problem, which does not admit a polynomial kernel unless .???./..作者: HEW 時間: 2025-3-31 08:24
Der 2. Hauptsatz der Thermodynamik,gned to handle arbitrary constraints under approximation-preserving reductions. Our proof exploits a close relationship between complex-weighted degree-2 #CSPs and Holant problems, which are a natural generalization of complex-weighted #CSPs.作者: 輕率的你 時間: 2025-3-31 13:03 作者: Ligneous 時間: 2025-3-31 14:31
Exact Parameterized Multilinear Monomial Counting via ,-Layer Subset Convolution and ,-Disjoint Sum the #.-path problem and the #.-set .-packing problem to the exact multilinear .-monomial counting problem, we give algorithms for these two problems that match the fastest known results presented in [2].作者: MEET 時間: 2025-3-31 19:20 作者: 人工制品 時間: 2025-3-31 23:39 作者: STING 時間: 2025-4-1 05:08 作者: Employee 時間: 2025-4-1 06:46 作者: DIS 時間: 2025-4-1 12:09 作者: bronchiole 時間: 2025-4-1 14:49 作者: Console 時間: 2025-4-1 19:43
