標(biāo)題: Titlebook: Computing and Combinatorics; 8th Annual Internati Oscar H. Ibarra,Louxin Zhang Conference proceedings 2002 Springer-Verlag Berlin Heidelber [打印本頁] 作者: digestive-tract 時(shí)間: 2025-3-21 16:32
書目名稱Computing and Combinatorics影響因子(影響力)
書目名稱Computing and Combinatorics影響因子(影響力)學(xué)科排名
書目名稱Computing and Combinatorics網(wǎng)絡(luò)公開度
書目名稱Computing and Combinatorics網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computing and Combinatorics被引頻次
書目名稱Computing and Combinatorics被引頻次學(xué)科排名
書目名稱Computing and Combinatorics年度引用
書目名稱Computing and Combinatorics年度引用學(xué)科排名
書目名稱Computing and Combinatorics讀者反饋
書目名稱Computing and Combinatorics讀者反饋學(xué)科排名
作者: 環(huán)形 時(shí)間: 2025-3-21 22:56
(2 + ,(,))-SAT and Its Propertieslems in . (denoted as .) with respect to this (2 + .(.))-SAT model. We prove that the restricted version of it is not in . under the assumption . ≠.. Actually it is indeed in . under some stronger but plausible assumption, specifically, the Exponential-Time Hypothesis (.) which was introduced by Impagliazzo and Paturi.作者: Melatonin 時(shí)間: 2025-3-22 04:13
On the Minimal Polynomial of a Matrixlosed under complement. The latter condition is one of the main open problems in this area..As an application of our techniques we show that the problem to decide whether a matrix is diagonalizable is complete for ..(.=.), the ..-..=..作者: Offset 時(shí)間: 2025-3-22 07:30 作者: 澄清 時(shí)間: 2025-3-22 12:17 作者: venous-leak 時(shí)間: 2025-3-22 16:22 作者: venous-leak 時(shí)間: 2025-3-22 17:09 作者: 惡心 時(shí)間: 2025-3-23 00:24 作者: 來這真柔軟 時(shí)間: 2025-3-23 03:21
2.1 Thermal conductivity at 273 - 300 K,ns of CBV-functions to semi-computable real numbers produce the whole closure of semi-computable real numbers under total computable real functions, and the image sets of semi-computable real numbers under monotone computable functions and CBV-functions are different.作者: glacial 時(shí)間: 2025-3-23 06:58
2.1 Thermal conductivity at 273 - 300 K,t . of resources suffices for an optimal off-line algorithm. The accommodating function was originally used only for α ≥ 1. We focus on α < 1, observe that the function now appears interesting for a greater variety of problems, and use it to make new distinctions between known algorithms and to find new ones.作者: 緊張過度 時(shí)間: 2025-3-23 13:12
3.1.2 Estimation method for alloys,ee with all the vertices of . as its leaves. In this paper, we show that this problem is NP-complete and MAX SNP-hard, even when the lengths of the edges are restricted to either 1 or 2. For the instances with lengths either 1 or 2, we give a 5/3-approximation algorithm to find an approximate solution for the problem.作者: legacy 時(shí)間: 2025-3-23 17:38
3.1.3 Comments on the presentation of data,king part in the process will not have enough information to decide or just to conjecture the outcome of the identification process..Moreover, we describe a fast (and general) method for generating (non-linear) codes with prescribed dot-products with the help of multi-linear polynomials.作者: 馬籠頭 時(shí)間: 2025-3-23 20:56
Co-orthogonal Codesking part in the process will not have enough information to decide or just to conjecture the outcome of the identification process..Moreover, we describe a fast (and general) method for generating (non-linear) codes with prescribed dot-products with the help of multi-linear polynomials.作者: 清楚 時(shí)間: 2025-3-24 02:07 作者: 表臉 時(shí)間: 2025-3-24 06:05
A Combinatorial Approach to Anonymous Membership Broadcastconcept of cover-free family studied by Erd?s . in early 80’s to derive bounds on parameters of CF set systems. We also discuss some possible extensions of the current work, motivated by different application.作者: 蟄伏 時(shí)間: 2025-3-24 10:11 作者: 依法逮捕 時(shí)間: 2025-3-24 13:24 作者: Anguish 時(shí)間: 2025-3-24 15:22 作者: 小口啜飲 時(shí)間: 2025-3-24 21:56
Extending the Accommodating Functiont . of resources suffices for an optimal off-line algorithm. The accommodating function was originally used only for α ≥ 1. We focus on α < 1, observe that the function now appears interesting for a greater variety of problems, and use it to make new distinctions between known algorithms and to find new ones.作者: minion 時(shí)間: 2025-3-24 23:53
The Full Steiner Tree Problem in Phylogenyee with all the vertices of . as its leaves. In this paper, we show that this problem is NP-complete and MAX SNP-hard, even when the lengths of the edges are restricted to either 1 or 2. For the instances with lengths either 1 or 2, we give a 5/3-approximation algorithm to find an approximate solution for the problem.作者: 誹謗 時(shí)間: 2025-3-25 04:19
3.1.3 Comments on the presentation of data,d that the computation would involve an impossible amount of computer time, that the size and repetitiveness of the genome would confound all attempts at assembly should sufficient computer efficiency be achieved, and that even if an assembly were produced it would be of an extremely poor quality and partial nature.作者: 解凍 時(shí)間: 2025-3-25 07:32
3.1.3 Comments on the presentation of data,lems in . (denoted as .) with respect to this (2 + .(.))-SAT model. We prove that the restricted version of it is not in . under the assumption . ≠.. Actually it is indeed in . under some stronger but plausible assumption, specifically, the Exponential-Time Hypothesis (.) which was introduced by Impagliazzo and Paturi.作者: 一個(gè)姐姐 時(shí)間: 2025-3-25 12:56
1.2 List of symbols and abbreviations,losed under complement. The latter condition is one of the main open problems in this area..As an application of our techniques we show that the problem to decide whether a matrix is diagonalizable is complete for ..(.=.), the ..-..=..作者: Organization 時(shí)間: 2025-3-25 18:05
3.1.3 Comments on the presentation of data,s and runs in .(log .) time with high probability, where . is the number of vertices of the input graph. The second algorithm is the first linear-time algorithm to 5-total-color subcubic graphs. The third algorithm generalizes this to the first linear-time algorithm to 5-list-total-color subcubic graphs.作者: Onerous 時(shí)間: 2025-3-25 20:46
3.1.2 Estimation method for alloys,lem can be solved in .(..(|.|, |.|) + log|.|) time using .(..(|.|, |.|) + (|.| + |.|)/log|.|) processors on ... Moreover, if . is represented by its decomposition tree form, the problem can be solved optimally in .(log |.|) time using .((|.| + |.|)/log|.|) processors on an EREW PRAM.作者: seroma 時(shí)間: 2025-3-26 02:35 作者: 不愿 時(shí)間: 2025-3-26 05:39 作者: Champion 時(shí)間: 2025-3-26 10:22 作者: 設(shè)施 時(shí)間: 2025-3-26 14:45 作者: chemoprevention 時(shí)間: 2025-3-26 17:35 作者: Venules 時(shí)間: 2025-3-27 00:22 作者: 痛苦一下 時(shí)間: 2025-3-27 02:51
1.2 List of symbols and abbreviations,hin Hamming distance . of a given binary query string .. We present an algorithm to determine if there is a member in . within . of a given query string . of length .. The method takes time .(..+1) in the RAM model, independent of ., and requires .(.) additional space.作者: vasculitis 時(shí)間: 2025-3-27 08:50
https://doi.org/10.1007/3-540-45655-4Automat; algorithms; automata; combinatorial optimization; combinatorics; complexity; complexity theory; co作者: 強(qiáng)化 時(shí)間: 2025-3-27 11:12
978-3-540-43996-7Springer-Verlag Berlin Heidelberg 2002作者: heterogeneous 時(shí)間: 2025-3-27 13:47 作者: gospel 時(shí)間: 2025-3-27 21:21
Polynomial Interpolation of the Elliptic Curve and XTR Discrete LogarithmWe prove lower bounds on the degree of polynomials interpolating the discrete logarithm in the group of points on an elliptic curve over a finite field and the XTR discrete logarithm, respectively.作者: Vulvodynia 時(shí)間: 2025-3-28 00:54
On Higher Arthur-Merlin Classesfine, and a number of interactions between these operators and the standard polynomial time hierarchy. We prove a hierarchy theorem for these higher Arthur-Merlin classes involving interleaving operators, and a theorem giving non-trivial upper bounds to the intersection of the complementary classes in the hierarchy.作者: athlete’s-foot 時(shí)間: 2025-3-28 05:52 作者: 曲解 時(shí)間: 2025-3-28 07:21
Inferring a Union of Halfspaces from Examplesimum cardinality set of halfspaces whose union covers all positive points and no negative points. We prove that approximation of this problem is at least as hard as approximation of graph coloring. On the other hand, we show that the two-dimensional case of the problem can be solved in polynomial time. Other related results are shown, too.作者: Infusion 時(shí)間: 2025-3-28 10:26
Dictionary Look-Up within Small Edit Distancehin Hamming distance . of a given binary query string .. We present an algorithm to determine if there is a member in . within . of a given query string . of length .. The method takes time .(..+1) in the RAM model, independent of ., and requires .(.) additional space.作者: Cardioversion 時(shí)間: 2025-3-28 17:10
3.1.3 Comments on the presentation of data,mining a “read” of 500 to 700bp at the two ends of each segment with an automated DNA sequencing instrument. Reconstructing or “assembling” a very large genome from such a data set was considered impossible at the time Jim Weber and I proposed it for the Human Genome (2.9Gbp) in 1996. Critics claime作者: LEER 時(shí)間: 2025-3-28 21:14
2.1 Thermal conductivity at 273 - 300 K, when ties among the rules that match an incoming packet are broken by selecting the matching rule that is most specific. For the case when the rule filters are destination-address prefixes or are nonintersecting ranges, this tie breaker corresponds to longest-prefix or shortest-range matching, resp作者: 敲竹杠 時(shí)間: 2025-3-29 00:35 作者: BATE 時(shí)間: 2025-3-29 05:43
3.1.2 Estimation method for alloys,fine, and a number of interactions between these operators and the standard polynomial time hierarchy. We prove a hierarchy theorem for these higher Arthur-Merlin classes involving interleaving operators, and a theorem giving non-trivial upper bounds to the intersection of the complementary classes 作者: delusion 時(shí)間: 2025-3-29 08:22
3.1.3 Comments on the presentation of data,d .. is an instance of 3-SAT which contains . 3-clauses. Фis an instance of (2 + .(.))-SAT if ../..+..≤ .(.). We prove that (2 + .(.))-SAT is in . if .(.) = . (log . /..), and in . if .(.) = 1/..(∨?: 0 < ε < 2). Most interestingly, we give a candidate ( 2 + (log .)./..)-SAT (. ≥ 2), for natural prob作者: Judicious 時(shí)間: 2025-3-29 11:42 作者: 指耕作 時(shí)間: 2025-3-29 16:24 作者: prostate-gland 時(shí)間: 2025-3-29 21:42 作者: debble 時(shí)間: 2025-3-30 01:44 作者: GULP 時(shí)間: 2025-3-30 06:38 作者: critique 時(shí)間: 2025-3-30 11:02
2.1 Thermal conductivity at 273 - 300 K, some resource is available, the accommodating function .(α) is the competitive ratio when input sequences are restricted to those for which the amount . of resources suffices for an optimal off-line algorithm. The accommodating function was originally used only for α ≥ 1. We focus on α < 1, observe作者: 小步走路 時(shí)間: 2025-3-30 13:07
3.1.2 Estimation method for alloys,that the given alignment is optimal at that parameter setting. We describe a .(. log .)-time algorithm for inverse global alignment without gap penalty and a .(. log .) time algorithm for global alignment with gap penalty, where . (. ≤ .) are the lengths of input strings. We then discuss algorithms 作者: 雕鏤 時(shí)間: 2025-3-30 19:51 作者: Vulnerary 時(shí)間: 2025-3-30 21:04 作者: figment 時(shí)間: 2025-3-31 02:40
1.2 List of symbols and abbreviations,hin Hamming distance . of a given binary query string .. We present an algorithm to determine if there is a member in . within . of a given query string . of length .. The method takes time .(..+1) in the RAM model, independent of ., and requires .(.) additional space.作者: AMOR 時(shí)間: 2025-3-31 05:15
3.1.3 Comments on the presentation of data,ld: first, it is easy to decide whether two codewords form a unique pair (this can be used in decoding information or identifying users of some not-publicly-available or non-free service on the Internet or elsewhere), and the identification process of the unique pair can be distributed between entit作者: Obligatory 時(shí)間: 2025-3-31 11:10
3.1.3 Comments on the presentation of data, algorithm is based on the MSB-first scheme and the proposed architectures have a low hardware complexity and small latency compared to conventional approaches. In particular, the hardware complexity and latency of the proposed parallel-in parallel-out array are about 19.8% and 25% lower, respective作者: 痛苦一生 時(shí)間: 2025-3-31 14:10 作者: ICLE 時(shí)間: 2025-3-31 20:54
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/234760.jpg作者: Axon895 時(shí)間: 2025-4-1 00:29 作者: debris 時(shí)間: 2025-4-1 04:12 作者: notice 時(shí)間: 2025-4-1 07:54 作者: 任命 時(shí)間: 2025-4-1 12:48 作者: cloture 時(shí)間: 2025-4-1 17:49 作者: DEMUR 時(shí)間: 2025-4-1 22:15
