標(biāo)題: Titlebook: Computing and Combinatorics; 7th Annual Internati Jie Wang Conference proceedings 2001 Springer-Verlag Berlin Heidelberg 2001 Graph.Graph t [打印本頁(yè)] 作者: Pierce 時(shí)間: 2025-3-21 18:43
書(shū)目名稱Computing and Combinatorics影響因子(影響力)
書(shū)目名稱Computing and Combinatorics影響因子(影響力)學(xué)科排名
書(shū)目名稱Computing and Combinatorics網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Computing and Combinatorics網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Computing and Combinatorics被引頻次
書(shū)目名稱Computing and Combinatorics被引頻次學(xué)科排名
書(shū)目名稱Computing and Combinatorics年度引用
書(shū)目名稱Computing and Combinatorics年度引用學(xué)科排名
書(shū)目名稱Computing and Combinatorics讀者反饋
書(shū)目名稱Computing and Combinatorics讀者反饋學(xué)科排名
作者: 參考書(shū)目 時(shí)間: 2025-3-21 20:28
Thermodynamik des Kraftfahrzeugsnumber of the envelope layers of .. When 1 = . = . (0 lt; € lt; 1), we propose an algorithm for computing the envelope layers of . in .(. log.p) time using . processors, where 1 = . = . 1-€/2 , and . is the functional inverse of Ackermann’s function which grows extremely slowly. The computational mo作者: 貪婪的人 時(shí)間: 2025-3-22 03:42 作者: 人類學(xué)家 時(shí)間: 2025-3-22 05:30 作者: 自負(fù)的人 時(shí)間: 2025-3-22 10:57
,Messung thermodynamischer Gr??en,A language is . if its intersection with every NP-complete language is in P. Such a language would provide an automatic method for generating easy instances of intractable problems. In this note, we give a complete characterization of universally polynomial languages that are context-free, answering an open question in [.].作者: 冒號(hào) 時(shí)間: 2025-3-22 16:33 作者: 冒號(hào) 時(shí)間: 2025-3-22 20:16 作者: FRONT 時(shí)間: 2025-3-22 23:58
On Universally Polynomial Context-Free LanguagesA language is . if its intersection with every NP-complete language is in P. Such a language would provide an automatic method for generating easy instances of intractable problems. In this note, we give a complete characterization of universally polynomial languages that are context-free, answering an open question in [.].作者: 細(xì)絲 時(shí)間: 2025-3-23 03:15
Packing Two Disks into a Polygonal Environmentersect each other, are contained in ., and whose radius is maximized. Our main result is a simple randomized algorithm whose expected running time, on worst case input, is .(. log .). This is optimal in the algebraic decision tree model of computation.作者: 古代 時(shí)間: 2025-3-23 08:32
https://doi.org/10.1007/3-540-44679-6Graph; Graph theory; algorithms; combinatorics; complexity; complexity theory; computability; computational作者: 精密 時(shí)間: 2025-3-23 11:03 作者: PANIC 時(shí)間: 2025-3-23 15:56
Computing and Combinatorics978-3-540-44679-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: handle 時(shí)間: 2025-3-23 18:53
0302-9743 Overview: Includes supplementary material: 978-3-540-42494-9978-3-540-44679-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Demonstrate 時(shí)間: 2025-3-23 23:45 作者: 換話題 時(shí)間: 2025-3-24 04:27
Thermodynamik des Kraftfahrzeugsence just like the difference between sequential and NC computation: (i) There is a Boolean function . of . variables which can be computed by a polynomial-size, syntactic BP with a depth of 2 log. - log log. + 1 but cannot be computed by any oblivious BPs with a depth of (2-ε)N for some ε ∈ .(1). (作者: –DOX 時(shí)間: 2025-3-24 08:38
,Messung thermodynamischer Gr??en,tted accepts exactly the class of recursively solvable problems. The class of problems accepted when access to the numeric universe is removed is exactly the class of recursively solvable problems that are closed under extensions. We build upon NSPQ(1) an in?nite hierarchy of classes of program sche作者: 致命 時(shí)間: 2025-3-24 11:38
Grundlagen der Technischen Thermodynamik,omplexity theory. Nonetheless, much remains unknown about the optimal advice complexity of classes having polynomial advice complexity..In particular, let P-sel denote the class of all P-selective sets [.] For the . advice complexity of P-sel, linear upper and lower bounds are known [.]. However, fo作者: Collar 時(shí)間: 2025-3-24 15:50 作者: occurrence 時(shí)間: 2025-3-24 20:51 作者: CREST 時(shí)間: 2025-3-25 02:38 作者: triptans 時(shí)間: 2025-3-25 03:31 作者: meritorious 時(shí)間: 2025-3-25 11:23
https://doi.org/10.1007/3-540-35050-0is well-shaped if the maximum aspect ratio of all its simplices is bounded from above by a constant. It is a long-term open problem to generate well-shaped .-dimensional Delaunay meshes for a given polyhedral domain. In this paper, we present a re?nement-based method that generates well-shaped .-dim作者: 羊欄 時(shí)間: 2025-3-25 14:37 作者: 享樂(lè)主義者 時(shí)間: 2025-3-25 16:49
Die Systeme und ihre Beschreibung,e diameter of .: i.e. the maximum distance between any pair of points in .. It has been shown that . = 7.559.. for an arbitrary ., and . = 3.496.. in the special case when . is a ball centered at the origin in the plane. In this paper we show that . = 12/ 3v 4p2 = 3.524.. is sufficient for an arbitr作者: 樂(lè)意 時(shí)間: 2025-3-25 22:46 作者: 凹處 時(shí)間: 2025-3-26 00:27 作者: 里程碑 時(shí)間: 2025-3-26 07:23
https://doi.org/10.1007/978-3-8348-9482-3ersect each other, are contained in ., and whose radius is maximized. Our main result is a simple randomized algorithm whose expected running time, on worst case input, is .(. log .). This is optimal in the algebraic decision tree model of computation.作者: Bumble 時(shí)間: 2025-3-26 10:00
,Zustands?nderungen Idealer Gase,, such that a pair of intervals in . can be matched only if they overlap with each other and have different colors. This problem arises in some applications such as radiosurgery treatment planning. We present a greedy algorithm for this problem that runs in .(. log log .) time for sorted input.We al作者: 束以馬具 時(shí)間: 2025-3-26 14:30 作者: 詩(shī)集 時(shí)間: 2025-3-26 20:09 作者: 稀釋前 時(shí)間: 2025-3-26 22:41 作者: GUILE 時(shí)間: 2025-3-27 02:23 作者: aqueduct 時(shí)間: 2025-3-27 08:36 作者: 有角 時(shí)間: 2025-3-27 10:12
Program Schemes, Queues, the Recursive Spectrum and Zero-One Lawstted accepts exactly the class of recursively solvable problems. The class of problems accepted when access to the numeric universe is removed is exactly the class of recursively solvable problems that are closed under extensions. We build upon NSPQ(1) an in?nite hierarchy of classes of program sche作者: panorama 時(shí)間: 2025-3-27 13:43 作者: Minatory 時(shí)間: 2025-3-27 21:34 作者: 火海 時(shí)間: 2025-3-28 01:51
Enhanced Sequence Reconstruction with DNA Microarray Applications the design of the probing scheme and of the associated sequence reconstruction algorithm.Recen tly a novel probing scheme, whose performance is within a constant factor of the information theory bound, has settled the issue of asymptotic optimality.Thus, the research focus has shifted to the ?ne t作者: 沒(méi)有希望 時(shí)間: 2025-3-28 03:35
Non-approximability of Weighted Multiple Sequence Alignmente .-complete and can be approximated within a constant factor, but it is unknown whether it has a polynomial time approximation scheme. Weighted multiple sequence alignment can be approximated within a factor of .(log..) where . is the number of sequences..We prove that weighted multiple sequence al作者: Induction 時(shí)間: 2025-3-28 07:35
A Greedy Algorithm for Optimal Recombinationa recombination of s. and s. at position . is de?ned as an operation that crosses s. and s. at position . and generates t.=a.a....a.b.+1...b. and t.=b.b....b.a.+1... a.. Denote . and . two collections of sequences. In this paper, we discuss generating . from . by a series of recombinations in minimu作者: 值得尊敬 時(shí)間: 2025-3-28 11:57
Generating Well-Shaped ,-dimensional Delaunay Meshesis well-shaped if the maximum aspect ratio of all its simplices is bounded from above by a constant. It is a long-term open problem to generate well-shaped .-dimensional Delaunay meshes for a given polyhedral domain. In this paper, we present a re?nement-based method that generates well-shaped .-dim作者: brother 時(shí)間: 2025-3-28 16:10
Towards Compatible Triangulationsnner, i.e., such that the resulting two planar graphs are isomorphic. The conjecture is proved true for point sets with at most three interior points. We further exhibit a class of point sets which can be triangulated compatibly with any other set (that satis?es the obvious size and hull restriction作者: Exploit 時(shí)間: 2025-3-28 19:30
An Improved Upper Bound on the Size of Planar Convex-Hullse diameter of .: i.e. the maximum distance between any pair of points in .. It has been shown that . = 7.559.. for an arbitrary ., and . = 3.496.. in the special case when . is a ball centered at the origin in the plane. In this paper we show that . = 12/ 3v 4p2 = 3.524.. is sufficient for an arbitr作者: ADAGE 時(shí)間: 2025-3-29 00:49 作者: 結(jié)束 時(shí)間: 2025-3-29 03:36 作者: Estimable 時(shí)間: 2025-3-29 10:31 作者: 一起平行 時(shí)間: 2025-3-29 13:10
Maximum Red/Blue Interval Matching with Application, such that a pair of intervals in . can be matched only if they overlap with each other and have different colors. This problem arises in some applications such as radiosurgery treatment planning. We present a greedy algorithm for this problem that runs in .(. log log .) time for sorted input.We al作者: 暫時(shí)別動(dòng) 時(shí)間: 2025-3-29 18:43
Computing Farthest Neighbors on a Convex Polytopeection .(.) of the diagram with the boundary of the convex hull of .. We give an algorithm that computes an implicit representation of .(.) in expected .(. log..) time. More precisely, we compute the combinatorial structure of .(.), the coordinates of its vertices, and the equation of the plane de?n作者: 辯論的終結(jié) 時(shí)間: 2025-3-29 20:22 作者: dictator 時(shí)間: 2025-3-30 00:16 作者: Capitulate 時(shí)間: 2025-3-30 04:31 作者: 完全 時(shí)間: 2025-3-30 12:04
Algebraic Properties for P-Selectivity are associatively P-selective then the deterministic advice complexity of P-sel is linear. (The weakest previously known sufficient condition was P = NP.) Relatedly, we prove that every associatively P-selective set is commutatively, associatively P-selective.作者: Precursor 時(shí)間: 2025-3-30 13:35
Efficient Generation of Triconnected Plane Triangulationstion. Also we can generate without duplications all triconnected (non-rooted) plane triangulations having exactly n vertices including exactly . vertices on the outer face in .(...) time per triangulation, and all maximal planar graphs in .(..) time per graph.作者: Callus 時(shí)間: 2025-3-30 19:48 作者: 流動(dòng)性 時(shí)間: 2025-3-30 22:08 作者: 波動(dòng) 時(shí)間: 2025-3-31 01:18
Maximum Red/Blue Interval Matching with Applicationations such as radiosurgery treatment planning. We present a greedy algorithm for this problem that runs in .(. log log .) time for sorted input.We also solve a useful generalization of this red/blue interval matching problem in the same time bound.作者: CAGE 時(shí)間: 2025-3-31 05:41 作者: Heretical 時(shí)間: 2025-3-31 10:54 作者: Allowance 時(shí)間: 2025-3-31 14:36
https://doi.org/10.1007/978-3-8348-9482-3ing each edge of .(.). The algorithm allows us to solve the all-pairs farthest neighbor problem for . in expected time .(. log..), and to perform farthest-neighbor queries on N in .(log..) time with high probability. This can be applied to find a Euclidean maximum spanning tree and a diameter 2-clustering of . in expected .(. log..) time.作者: NIB 時(shí)間: 2025-3-31 17:59
Zustandsgleichungen Idealer Gase,such that the sum of three distances .(.), .(.)and .(.), with any .′ € . and any .′ € ., is minimized. We present an .(. log..)time algorithm for finding an optimal bridge between two simple polygons. This significantly improves upon the previous .(..)time bound.作者: Arresting 時(shí)間: 2025-4-1 01:37
Grundlagen der Technischen Thermodynamik,.b....b.a.+1... a.. Denote . and . two collections of sequences. In this paper, we discuss generating . from . by a series of recombinations in minimum number of steps. We present a greedy algorithm for ?nding the optimal recombination evolutionary history from . to any tree . of sequences when |.|=2.作者: Obverse 時(shí)間: 2025-4-1 05:07
Zustandsgleichungen Idealer Gase, We further exhibit a class of point sets which can be triangulated compatibly with any other set (that satis?es the obvious size and hull restrictions). Finally, we prove that adding a small number of Steiner points (the number of interior points minus two) always allows for compatible triangulations.作者: 大都市 時(shí)間: 2025-4-1 07:30 作者: 名字 時(shí)間: 2025-4-1 10:43 作者: 單挑 時(shí)間: 2025-4-1 17:18
On the Planar Two-Watchtower Problemild condition on solving a special cubic equation with three bounded variables in .(..) time we can also generalize the algorithm to solve the general problem in .(.. +....) time. Using parametric search, the discrete problem can be solvedin .(.. log..) time and the general problem can be solved in .(.. log..) time.作者: 奇怪 時(shí)間: 2025-4-1 20:13
Computing Farthest Neighbors on a Convex Polytopeing each edge of .(.). The algorithm allows us to solve the all-pairs farthest neighbor problem for . in expected time .(. log..), and to perform farthest-neighbor queries on N in .(log..) time with high probability. This can be applied to find a Euclidean maximum spanning tree and a diameter 2-clustering of . in expected .(. log..) time.作者: 小淡水魚(yú) 時(shí)間: 2025-4-2 00:50
Finding an Optimal Bridge between Two Polygonssuch that the sum of three distances .(.), .(.)and .(.), with any .′ € . and any .′ € ., is minimized. We present an .(. log..)time algorithm for finding an optimal bridge between two simple polygons. This significantly improves upon the previous .(..)time bound.作者: 開(kāi)始從未 時(shí)間: 2025-4-2 03:43
Thermodynamik des Kraftfahrzeugscted) BP of depth . can be simulated by an oblivious BP with a depth of . + ?(. - log.)/(log log. + .)?·.. The third result implies that .. cannot be computed by any BP with a depth less than log. +log log. and .. not with a depth of o(log.·log log.). Note that most bounds in this paper include factors and lower-degree terms.作者: Aromatic 時(shí)間: 2025-4-2 09:12 作者: gerontocracy 時(shí)間: 2025-4-2 11:13
,Messung thermodynamischer Gr??en,re, which, exploiting the knowledge acquired in the course of the sequence reconstruction process, achieves typically a 20% performance improvement over the previous best technique, and comes at 90%-con?dence within a factor 0.5 of the information-theory bound.
