標(biāo)題: Titlebook: LATIN ‘92; 1st Latin American S Imre Simon Conference proceedings 1992 Springer-Verlag Berlin Heidelberg 1992 Algorithms.Automat.algorithm. [打印本頁] 作者: 大口水罐 時間: 2025-3-21 18:07
書目名稱LATIN ‘92影響因子(影響力)
書目名稱LATIN ‘92影響因子(影響力)學(xué)科排名
書目名稱LATIN ‘92網(wǎng)絡(luò)公開度
書目名稱LATIN ‘92網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱LATIN ‘92被引頻次
書目名稱LATIN ‘92被引頻次學(xué)科排名
書目名稱LATIN ‘92年度引用
書目名稱LATIN ‘92年度引用學(xué)科排名
書目名稱LATIN ‘92讀者反饋
書目名稱LATIN ‘92讀者反饋學(xué)科排名
作者: encyclopedia 時間: 2025-3-21 22:21 作者: osteoclasts 時間: 2025-3-22 03:08 作者: endoscopy 時間: 2025-3-22 07:49
https://doi.org/10.1007/BFb0023811Algorithms; Automat; algorithm; automata; complexity; complexity theory; computability; computational geome作者: 窗簾等 時間: 2025-3-22 11:28 作者: 臆斷 時間: 2025-3-22 16:18
A decidability result about convex polyominoes,ight, left, up and down). According to, checking whether a rational language R?A. contains a polyomino contour word is undecidable. We restrict the problem to convex polyominoes and we prove that, in this case, the problem turns out to be decidable.作者: 現(xiàn)代 時間: 2025-3-22 17:06
Edge insertion for optimal triangulations,d retriangulating the resulting two polygonal regions. After presenting an abstract view of the paradigm, this paper shows that it can be used to obtain polynomial time algorithms for several types of optimal triangulations.作者: 纖細 時間: 2025-3-22 22:21 作者: 影響帶來 時間: 2025-3-23 01:45 作者: Matrimony 時間: 2025-3-23 05:48 作者: 我正派 時間: 2025-3-23 13:29
Complex polynomials and circuit lower bounds for modular counting,It is easy to show that a depth 2 circuit of size . (where . is the number of inputs) containing . gates can determine whether the sum of the input bits is divisible by ., for any fixed .>1, whereas it is known that this requires exponentialsize circuits if we have no . gates. Our main result is tha作者: 吹氣 時間: 2025-3-23 15:23 作者: 迷住 時間: 2025-3-23 20:29
Edge insertion for optimal triangulations,d retriangulating the resulting two polygonal regions. After presenting an abstract view of the paradigm, this paper shows that it can be used to obtain polynomial time algorithms for several types of optimal triangulations.作者: harpsichord 時間: 2025-3-23 22:10
Simulating permutation networks on hypercubes,tation networks on hypercubes. Our embeddings exhibit a marked trade-off between dilation and expansion and for the .-dimensional star network have the following dilation and expansion bounds:.The embeddings are, in fact, optimum or nearly optimum in both dilation and expansion for small values of .作者: MURAL 時間: 2025-3-24 06:23 作者: obsession 時間: 2025-3-24 09:57
Parallel complexity of heaps and min-max heaps,n (e.g., the heap, the minmax heap, and the deap) can be constructed in linear sequential time. In this paper, we design optimal Ω((log log .).) time parallel algorithms with ./(log log.). processors for the constructions on the parallel comparison tree model. For building heaps in parallel, our alg作者: 肉身 時間: 2025-3-24 12:36
On the complexity of some problems for the Blum, Shub & Smale model,putation. We also introduce a class of languages . lying between . and . that uses probabilistic machines, and several problems from the same area are classified as “probably noncomplete” by showing their membership in ..作者: 排名真古怪 時間: 2025-3-24 15:00 作者: 因無茶而冷淡 時間: 2025-3-24 19:44
How to write integers in non-integer base,ansion. We give examples which show that this is not the general case, even for θ being a Pisot number. In connection with symbolic dynamics two families of Pisot numbers such that every integer has a finite expansion are given: when θ is the dominant root of the polynomial X. ? a.X.?1-... -a., wher作者: 立即 時間: 2025-3-25 01:56
A simple randomized parallel algorithm for maximal ,-matchings,inclusion) .-matchings. Our algorithm works in .(log..) time on an arbitrary . with a linear number of processors. Also we slightly improve a constant coefficient in the analysis of the Israeli-Itai algorithm. Finally we present more efficient NC algorithms for maximal .-matchings for several non-tr作者: 駕駛 時間: 2025-3-25 05:25
Factoring in skew-polynomial rings,f polynomials K[.], where K is a finite field and σ: K → K is an automorphism. Applications include fast functional decomposition algorithms for a class of polynomials in K[.] whose decompositions are “wild” and previously thought to be difficult to compute. Also presented is a fast probabilistic al作者: 小爭吵 時間: 2025-3-25 08:50
Leaders election without conflict resolution rule,ders election problem is related to the problem of simulating stronger CRCW models, which support leaders election by pre-defined conflict resolution rules. We give a randomized simulation of .-a very strong CRCW PRAM-on .. The simulation is optimal, reliable, and runs in nearly doubly logarithmic t作者: 壟斷 時間: 2025-3-25 13:41
and mild traumatic brain injuries.Chronic back and neck pain. Whiplash. Fibromyalgia. Carpal tunnel syndrome. Intractable headaches. Depression. Anxiety and posttraumatic stress. Concussion. More than ever, the term workplace disabilities is synonymous with greater clinical and case management compl作者: refraction 時間: 2025-3-25 18:30 作者: NOVA 時間: 2025-3-25 23:20
Danièle Beauquier,Michel Latteux,Karine Slowinskithe early 1990‘s will application of only 15 to 20 years, epitomizes amount to millions of pounds of advanced the rapidity with which a generation‘s change composites. in the state-of-the-art can take place. This is in We find ourselves in a peculiar position. marked contrast to past history, in whi作者: collagenase 時間: 2025-3-26 03:13 作者: ethereal 時間: 2025-3-26 04:31
Said Bettayeb,Bin Cong,Mike Girou,I. Hal Sudboroughthe early 1990‘s will application of only 15 to 20 years, epitomizes amount to millions of pounds of advanced the rapidity with which a generation‘s change composites. in the state-of-the-art can take place. This is in We find ourselves in a peculiar position. marked contrast to past history, in whi作者: faculty 時間: 2025-3-26 09:35
Manuel Blumls should be familiar with or should know where to find when necessary. The focus of this book concerns the properties and the accepted means of trans- portation, storage, and handling of compressed gases. This Handbook is simul- taneously intended as an overview of the subject and a source of suppl作者: 一起 時間: 2025-3-26 14:35
F. Bossut,B. Warinls should be familiar with or should know where to find when necessary. The focus of this book concerns the properties and the accepted means of trans- portation, storage, and handling of compressed gases. This Handbook is simul- taneously intended as an overview of the subject and a source of suppl作者: Expiration 時間: 2025-3-26 19:04
Anne Brüggemann-Kleinls should be familiar with or should know where to find when necessary. The focus of this book concerns the properties and the accepted means of trans- portation, storage, and handling of compressed gases. This Handbook is simul- taneously intended as an overview of the subject and a source of suppl作者: NIB 時間: 2025-3-26 21:51
Véronique Bruyèrese materials should be familiar with or should know where to find when necessary. The focus of this book concerns the properties and the accepted means of trans- portation, storage, and handling of compressed gases. This Handbook is simul- taneously intended as an overview of the subject and a sourc作者: 辯論 時間: 2025-3-27 03:33
Svante Carlsson,Jingsen Chenls should be familiar with or should know where to find when necessary. The focus of this book concerns the properties and the accepted means of trans- portation, storage, and handling of compressed gases. This Handbook is simul- taneously intended as an overview of the subject and a source of suppl作者: Affection 時間: 2025-3-27 08:14
Felipe Cucker,Francesc Rossellóls should be familiar with or should know where to find when necessary. The focus of this book concerns the properties and the accepted means of trans- portation, storage, and handling of compressed gases. This Handbook is simul- taneously intended as an overview of the subject and a source of suppl作者: pacifist 時間: 2025-3-27 11:05
W. Fernandez de la Vega,V. Th. Paschos,R. Saadls should be familiar with or should know where to find when necessary. The focus of this book concerns the properties and the accepted means of trans- portation, storage, and handling of compressed gases. This Handbook is simul- taneously intended as an overview of the subject and a source of suppl作者: 比賽用背帶 時間: 2025-3-27 16:34 作者: Predigest 時間: 2025-3-27 19:19
Christiane Frougnyse materials should be familiar with or should know where to find when necessary. The focus of this book concerns the properties and the accepted means of trans- portation, storage, and handling of compressed gases. This Handbook is simul- taneously intended as an overview of the subject and a sourc作者: enormous 時間: 2025-3-28 01:36
Oscar Garrido,Stefan Jarominek,Andrzej Lingas,Wojciech Rytterse materials should be familiar with or should know where to find when necessary. The focus of this book concerns the properties and the accepted means of trans- portation, storage, and handling of compressed gases. This Handbook is simul- taneously intended as an overview of the subject and a sourc作者: 沖擊力 時間: 2025-3-28 03:59
William I. Gasarch,Katia S. Guimar?esls should be familiar with or should know where to find. The focus ofthis book concerns the properties and the accepted means oftransportation, storage, and handlingofcompressed gases. This handbook is simultaneously intended as an overview ofthe subject and a source ofsupplementary information. It 作者: 我不明白 時間: 2025-3-28 07:59
Mark Giesbrechtse materials should be familiar with or should know where to find. The focus ofthis book concerns the properties and the accepted means oftransportation, storage, and handlingofcompressed gases. This handbook is simultaneously intended as an overview ofthe subject and a source ofsupplementary inform作者: 細微的差異 時間: 2025-3-28 13:43 作者: 擴大 時間: 2025-3-28 16:41
Leaders election without conflict resolution rule,ing on different CRCW PRAMs. Moreover, it implies that the memory to which concurrent read or concurrent write are assumed should . be more than linear-the rest of the memory can always be addressed under the EREW convention. The techniques presented in this paper tackle fundamental difficulties in the design of fast parallel algorithms.作者: 固執(zhí)點好 時間: 2025-3-28 22:28
Simulating permutation networks on hypercubes,, which are the important cases in practice. We also show that any star network with dimension at least 4 is not a subgraph of a hypercube and that any embedding with .(1) expansion must have dilation ..作者: 朋黨派系 時間: 2025-3-29 00:19 作者: 大氣層 時間: 2025-3-29 07:02 作者: 容易做 時間: 2025-3-29 07:43
Conference proceedings 1992razil in April1992. LATIN is intended to be a comprehensivesymposium inthe theory of computing, but for this first meetingthefollowing areas were chosen for preferential coverage:algorithms and data structures, automata and formallanguages, computability and complexity theory,computational geometry,作者: Suppository 時間: 2025-3-29 12:08 作者: filicide 時間: 2025-3-29 15:47 作者: 無能的人 時間: 2025-3-29 23:08
Average case analysis of a greedy algorithm for the minimum hitting set problem,f minimum cardinality. The purpose of this paper is to study the efficiency of a natural greedy algorithm for the approximate solution of the minimum hitting set probl em when . is a random family of .-element subsets, . fixed, and when . and . tend to ∞ with .., a fixed constant.作者: 人類學(xué)家 時間: 2025-3-30 02:20
How to write integers in non-integer base,ies of Pisot numbers such that every integer has a finite expansion are given: when θ is the dominant root of the polynomial X. ? a.X.?1-... -a., where a. ≥ a. ≥... ≥a. ≥ 1 are integers, and when θ is the dominant root of the polynomial X. ?(t.+1)X.+(t.?t.)X.+...+ (t.?t.)X + (t.?t.) where t.≥ t. ≥ ...≥t.≥t.≥1 are integers.作者: 鄙視讀作 時間: 2025-3-30 06:24
A simple randomized parallel algorithm for maximal ,-matchings, coefficient in the analysis of the Israeli-Itai algorithm. Finally we present more efficient NC algorithms for maximal .-matchings for several non-trivial graph classes and a faster RNC algorithm for approximate-maximal .-matching in general graphs.作者: PLUMP 時間: 2025-3-30 11:56
Factoring in skew-polynomial rings,ss of polynomials in K[.] whose decompositions are “wild” and previously thought to be difficult to compute. Also presented is a fast probabilistic algorithm for finding zero divisors in any finite associative algebra over K.作者: 獨特性 時間: 2025-3-30 14:29
0302-9743 oPaulo, Brazil in April1992. LATIN is intended to be a comprehensivesymposium inthe theory of computing, but for this first meetingthefollowing areas were chosen for preferential coverage:algorithms and data structures, automata and formallanguages, computability and complexity theory,computational作者: 比喻好 時間: 2025-3-30 20:27 作者: Enliven 時間: 2025-3-30 23:51
Achieving optimality for gate matrix layout and PLA folding: A graph theoretic approach,作者: FLOAT 時間: 2025-3-31 04:51 作者: CROW 時間: 2025-3-31 07:25
Danièle Beauquier,Michel Latteux,Karine Slowinskithe state-of-the-art to the class of materials-advanced composites- designer in a form in which it can be applied and established its feasibility by the fabrication readily to practical structures. I believe that of raw fiber with exceptional strength- and this book, Handbook of Composites, will mod作者: 孵卵器 時間: 2025-3-31 09:28
M. Bern,H. Edelsbrunner,D. Eppstein,S. Mitchell,T. S. Tanthe state-of-the-art to the class of materials-advanced composites- designer in a form in which it can be applied and established its feasibility by the fabrication readily to practical structures. I believe that of raw fiber with exceptional strength- and this book, Handbook of Composites, will mod作者: boisterous 時間: 2025-3-31 16:31
Said Bettayeb,Bin Cong,Mike Girou,I. Hal Sudboroughthe state-of-the-art to the class of materials-advanced composites- designer in a form in which it can be applied and established its feasibility by the fabrication readily to practical structures. I believe that of raw fiber with exceptional strength- and this book, Handbook of Composites, will mod作者: 條街道往前推 時間: 2025-3-31 18:27
Manuel Blumsociation. Some of these publications have been incorporated by reference into federal, state, provincial, and local regulations. Since these pam- phlets are reviewed on a periodic basis, wherever the text of this Handbook may be found in conflict with corresponding information in the CGA technical 作者: Intuitive 時間: 2025-3-31 23:48 作者: GEN 時間: 2025-4-1 05:30 作者: 延期 時間: 2025-4-1 09:18
Véronique Bruyèresed Gas Association. Some of these publications have been incorporated by reference into federal, state, provincial, and local regulations. Since these pam- phlets are reviewed on a periodic basis, wherever the text of this Handbook may be found in conflict with corresponding information in the CGA technical 978-1-4612-8020-0978-1-4613-0673-3
