標(biāo)題: Titlebook: Discrete Mathematics and Theoretical Computer Science; 4th International Co Cristian S. Calude,Michael J. Dinneen,Vincent Vajn Conference p [打印本頁] 作者: 故障 時間: 2025-3-21 16:33
書目名稱Discrete Mathematics and Theoretical Computer Science影響因子(影響力)
書目名稱Discrete Mathematics and Theoretical Computer Science影響因子(影響力)學(xué)科排名
書目名稱Discrete Mathematics and Theoretical Computer Science網(wǎng)絡(luò)公開度
書目名稱Discrete Mathematics and Theoretical Computer Science網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Discrete Mathematics and Theoretical Computer Science被引頻次
書目名稱Discrete Mathematics and Theoretical Computer Science被引頻次學(xué)科排名
書目名稱Discrete Mathematics and Theoretical Computer Science年度引用
書目名稱Discrete Mathematics and Theoretical Computer Science年度引用學(xué)科排名
書目名稱Discrete Mathematics and Theoretical Computer Science讀者反饋
書目名稱Discrete Mathematics and Theoretical Computer Science讀者反饋學(xué)科排名
作者: Priapism 時間: 2025-3-21 22:15
Discrete Mathematics and Theoretical Computer Science4th International Co作者: SPECT 時間: 2025-3-22 00:55
Cristian S. Calude,Michael J. Dinneen,Vincent Vajn作者: alcohol-abuse 時間: 2025-3-22 04:40
On Unimodality of Independence Polynomials of Some Well-Covered Treesl and locate its mode, where a . is a tree having at most one vertex of degree at least three. In addition, we extend some graph transformations, first introduced in [.], respecting independence polynomials. They allow us to reduce several types of well-covered trees to claw-free graphs, and, conseq作者: arboretum 時間: 2025-3-22 10:51 作者: 簡略 時間: 2025-3-22 13:35
Metallurgy of Soldering and Solderabilitymethod [.,.] to make it applicable to such cases. Our approach sheds new light on well-studied classes like NPSV and NPMV, allows to give simpler proofs for known results, and shows that the spectrum of function classes closely resembles the spectrum of well-known complexity classes.作者: 簡略 時間: 2025-3-22 20:52
Regular Expressions with Timed Dominoes of a regular expression, that does not go through translating expressions into timed automata. To this end we use the class of 2.-automata, studied in a parallel paper [.] in connection with the problem of representing timing constraints.作者: JECT 時間: 2025-3-23 01:11
On Functions and Relationsmethod [.,.] to make it applicable to such cases. Our approach sheds new light on well-studied classes like NPSV and NPMV, allows to give simpler proofs for known results, and shows that the spectrum of function classes closely resembles the spectrum of well-known complexity classes.作者: Pantry 時間: 2025-3-23 03:47 作者: 鎮(zhèn)壓 時間: 2025-3-23 07:00
Recovery Mechanisms of Alkaline Floodingosures of these classes are represented by finite labeled posets. We give algorithms for calculating these posets and related problems. As a consequence we obtain representations of the set classes NP(.) ∩ coNP(.) by means of finite labeled posets.作者: calumniate 時間: 2025-3-23 10:57
https://doi.org/10.1007/978-3-642-14189-8We also show that these automatic generic sets are not regular but may be context free. Furthermore, we introduce stronger automatic genericity notions based on regular extension functions of nonconstant length and we show that the corresponding generic sets are bi-immune for the class of regular and context free languages.作者: 哪有黃油 時間: 2025-3-23 15:51 作者: 同謀 時間: 2025-3-23 19:18
History of Surface Geochemistryords of certain linear codes. The condition is derived using exponential sums. We then construct some linear codes whose covering structure can be determined, and use them to construct secret sharing schemes with interesting access structures.作者: CHECK 時間: 2025-3-24 00:59
Statistical Analysis and Spatial Variationffix the next letter assumes at least two values. Finally we generalize this method so that it works under a weaker condition satisfied by almost all the Gray codes in the literature: if the next letter assumes only one value, then the interval contains only one word.作者: 設(shè)施 時間: 2025-3-24 05:45 作者: 征兵 時間: 2025-3-24 07:43 作者: ingestion 時間: 2025-3-24 11:44
Generating Gray Codes in ,(1) Worst-Case Time per Wordffix the next letter assumes at least two values. Finally we generalize this method so that it works under a weaker condition satisfied by almost all the Gray codes in the literature: if the next letter assumes only one value, then the interval contains only one word.作者: extemporaneous 時間: 2025-3-24 18:35
Efficient Algorithms for Disjoint Matchings among Intervals and Related Problems among intervals. A sufficient condition is established for the existence of such a matching. The proof of this result yields a linear-time algorithm to compute it in this case. Besides, a greedy heuristic is shown to solve the problem in linear time for proper intervals.作者: bacteria 時間: 2025-3-24 22:06 作者: 防銹 時間: 2025-3-25 00:45 作者: Instantaneous 時間: 2025-3-25 05:24 作者: Sigmoidoscopy 時間: 2025-3-25 08:04 作者: 殺人 時間: 2025-3-25 15:22
Combinatorial Problems Arising in SNP and Haplotype Analysiss paper presents a number of algorithmic and combinatorial problems that arise when studying a very common form of genomic variation, single nucleotide polymorphisms (SNPs). We review recent results and present challenging open problems.作者: patella 時間: 2025-3-25 16:27 作者: Mitigate 時間: 2025-3-25 22:28
Listing Vertices of Simple Polyhedra Associated with Dual , Systemshm is based on a characterisation of their graphical basis structures, whose set of edges are shown to consist of vertex-disjoint components that are either a tree or a subgraph with only one cycle. The algorithm generates vertices via operations on the basis graph, rather than by simplex transforma作者: AORTA 時間: 2025-3-26 01:25 作者: Resection 時間: 2025-3-26 08:05
On the Order Dual of a Riesz Spacectionals, and their relation to the strong extensionality, are examined. A necessary and sufficient condition for the existence of the supremum of two elements of the order dual of a Rieszs pace with unit is obtained.作者: 或者發(fā)神韻 時間: 2025-3-26 12:12 作者: 惹人反感 時間: 2025-3-26 13:42
Efficient Algorithms for Disjoint Matchings among Intervals and Related Problems Such problems find applications in schedules planning. First, we propose a new incremental algorithm to compute maximum disjoint matchings among intervals. We show that this algorithm runs in .(.) time if the intervals are given ordered in input. Additionally, a shorter algorithm is given for the c作者: CRUE 時間: 2025-3-26 19:24
On Functions and RelationsIn order to compare classes of multi-valued and single-valued functions with respect to the existence of refinements we extend the so called operator method [.,.] to make it applicable to such cases. Our approach sheds new light on well-studied classes like NPSV and NPMV, allows to give simpler proo作者: 神圣不可 時間: 2025-3-27 00:03
Paths Coloring Algorithms in Mesh Networksn all-optical networks. Our main result is a simple 4-approximation algorithm for coloring line-column paths on a mesh. We also present sharper results when there is a restriction on the path lengths. Moreover, we show that these results can be extended to toroidal meshes and to line-column or colum作者: 暴行 時間: 2025-3-27 04:08
Finite State Strategies in One Player McNaughton Gamesent is it to find whether or not the player wins the game?If the player wins the game, then how much memory is needed to win the game?F or a given number ., what does the underlying graph look like if the player has a winning strategy of memory size .?作者: 繁忙 時間: 2025-3-27 09:08 作者: Infiltrate 時間: 2025-3-27 11:45
Boolean NP-Partitions and Projective Closurective closures are the largest classes among these with respect to set inclusion. In this paper we investigate projective closures of classes of boolean NP-partitions, i.e., partitions with components that have complexity upper-bounds in the boolean hierarchy over NP. We prove that the projective cl作者: DEMUR 時間: 2025-3-27 14:16 作者: Congruous 時間: 2025-3-27 19:18
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/281147.jpg作者: 從容 時間: 2025-3-27 23:05
History of Surface Geochemistrywhether mathematics is invented or discovered, i.e., is empirical or is .. Second, we propose that the notion of algorithmic independence sheds light on the question of being and how the world of our experience can be partitioned into separate entities.作者: agitate 時間: 2025-3-28 03:02 作者: Confess 時間: 2025-3-28 08:23
Grids, Surveys, Models, and Economicss paper presents a number of algorithmic and combinatorial problems that arise when studying a very common form of genomic variation, single nucleotide polymorphisms (SNPs). We review recent results and present challenging open problems.作者: encyclopedia 時間: 2025-3-28 10:36 作者: Coronation 時間: 2025-3-28 17:31 作者: capillaries 時間: 2025-3-28 20:09 作者: 加強(qiáng)防衛(wèi) 時間: 2025-3-29 00:53 作者: 開始從未 時間: 2025-3-29 05:53 作者: tolerance 時間: 2025-3-29 09:17 作者: 搜集 時間: 2025-3-29 13:34 作者: intelligible 時間: 2025-3-29 19:18
Solder Paste and Its Applicationn all-optical networks. Our main result is a simple 4-approximation algorithm for coloring line-column paths on a mesh. We also present sharper results when there is a restriction on the path lengths. Moreover, we show that these results can be extended to toroidal meshes and to line-column or colum作者: 詳細(xì)目錄 時間: 2025-3-29 23:00 作者: 手銬 時間: 2025-3-29 23:58
Surface Patterning with Colloidal Monolayers graphs and Fibonacci graphs (which give a generic example of non-series-parallel graphs). Motivated by the fact that the most compact expressions of series-parallel graphs are read-once formulae, and, thus, of .(.) length, we propose an algorithm generating expressions of .(..) length for Fibonacci作者: 植物群 時間: 2025-3-30 05:09
Recovery Mechanisms of Alkaline Floodingctive closures are the largest classes among these with respect to set inclusion. In this paper we investigate projective closures of classes of boolean NP-partitions, i.e., partitions with components that have complexity upper-bounds in the boolean hierarchy over NP. We prove that the projective cl作者: 變白 時間: 2025-3-30 08:29
Recovery Mechanisms of Alkaline Flooding of . (I. Gutman and F. Harary 1983). In 1990, Y.O. Hamidoune proved that for any . (a graph having no induced subgraph isomorphic to ..), .(.; .) is unimodal, i.e., there exists some . ∈ {0, 1, ..., .(.)} such that . Y. Alavi, P.J. Malde, A.J. Schwenk, and P. Erd?s (1987) asked whether for trees th作者: GEON 時間: 2025-3-30 12:27 作者: 租約 時間: 2025-3-30 19:24 作者: dilute 時間: 2025-3-30 21:21 作者: 過剩 時間: 2025-3-31 02:24 作者: 劇毒 時間: 2025-3-31 08:53 作者: Resection 時間: 2025-3-31 10:58 作者: misanthrope 時間: 2025-3-31 15:29 作者: 小臼 時間: 2025-3-31 17:50 作者: ironic 時間: 2025-3-31 22:51
https://doi.org/10.1007/978-1-4615-2660-5The first paper on cellular automata in the hyperbolic plane appeared in [.], based on the technical report [.]. Later, several papers appeared in order to explore this new branch of computer science. Although applications are not yet seen, they may appear, especially in physics, in the theory of relativity or for cosmological researches.作者: 誘導(dǎo) 時間: 2025-4-1 03:58
https://doi.org/10.1007/978-1-4684-2772-1It was known that every graph can be constructed from a finite list of elementary graphs using the operations of graph sum and graph composition. We determine a complete set of “equations” or rewriting rules with the property that two expressions represent the same graph if and only if one can be transformed into the other by means of these rules.作者: 他很靈活 時間: 2025-4-1 09:41 作者: 情愛 時間: 2025-4-1 13:24
Metallurgy of Soldering and SolderabilityWe prove in this paper that there exists some infinitary rational relations which are Σ.-complete Borel sets and some others which are Π.-complete. These results give additional answers to questions of Simonnet [.] and of Lescow and Thomas [.,.].作者: vanquish 時間: 2025-4-1 17:18
Cellular Automata and Combinatoric Tilings in Hyperbolic Spaces. A SurveyThe first paper on cellular automata in the hyperbolic plane appeared in [.], based on the technical report [.]. Later, several papers appeared in order to explore this new branch of computer science. Although applications are not yet seen, they may appear, especially in physics, in the theory of relativity or for cosmological researches.作者: conflate 時間: 2025-4-1 20:55 作者: motor-unit 時間: 2025-4-1 23:03
ECO Method and the Exhaustive Generation of Convex PolyominoesECO is a method for the enumeration of classes of combinatorial objects based on recursive constructions of such classes. In this paper we use the ECO method and the concept of succession rule to develop an algorithm for the exhaustive generation of convex polyominoes. Then we prove that this algorithm runs in constant amortized time.作者: 努力趕上 時間: 2025-4-2 03:53 作者: 消耗 時間: 2025-4-2 08:36
https://doi.org/10.1007/3-540-45066-1Automat; algorithms; automata; combinatorial optimization; complexity; computer; computer science; informat
