標(biāo)題: Titlebook: Automata, Languages and Programming; 33rd International C Michele Bugliesi,Bart Preneel,Ingo Wegener Conference proceedings 2006 Springer-V [打印本頁(yè)] 作者: 時(shí)間 時(shí)間: 2025-3-21 16:26
書目名稱Automata, Languages and Programming影響因子(影響力)
書目名稱Automata, Languages and Programming影響因子(影響力)學(xué)科排名
書目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開度
書目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Automata, Languages and Programming被引頻次
書目名稱Automata, Languages and Programming被引頻次學(xué)科排名
書目名稱Automata, Languages and Programming年度引用
書目名稱Automata, Languages and Programming年度引用學(xué)科排名
書目名稱Automata, Languages and Programming讀者反饋
書目名稱Automata, Languages and Programming讀者反饋學(xué)科排名
作者: Antigen 時(shí)間: 2025-3-21 21:44
Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTss in any MST of .. We use a lower bound given by a linear programming relaxation to the problem and strengthen known graph-theoretic results on minimum degree subgraphs [3,5] to prove our result. Previous results for the problem [1,4] used a combinatorial lower bound which is weaker than the LP bound we use.作者: 疲憊的老馬 時(shí)間: 2025-3-22 02:50 作者: 急急忙忙 時(shí)間: 2025-3-22 06:57
Ergebnisse der qualitativen Interviews,digraphs ., the problem is in P and for the rest of the digraphs . the problem is #P-complete. An interesting feature of the dichotomy, absent from related dichotomy results, is the rich supply of tractable graphs?. with complex structure.作者: inflame 時(shí)間: 2025-3-22 11:34 作者: 小步走路 時(shí)間: 2025-3-22 16:12 作者: adumbrate 時(shí)間: 2025-3-22 20:30 作者: Emmenagogue 時(shí)間: 2025-3-22 22:04
Krankheiten und Besch?digungen an Hafermetric which allows us to analyse a one-step path coupling. This approach provides insight for the design of better metrics for specific problems. We give illustrative applications to hypergraph independent sets and SAT instances, hypergraph colourings and colourings of bipartite graphs, obtaining improved results for all these problems.作者: 無(wú)動(dòng)于衷 時(shí)間: 2025-3-23 04:49 作者: Nebulous 時(shí)間: 2025-3-23 08:22 作者: Inflamed 時(shí)間: 2025-3-23 11:08 作者: HOWL 時(shí)間: 2025-3-23 14:18
On Counting Homomorphisms to Directed Acyclic Graphsdigraphs ., the problem is in P and for the rest of the digraphs . the problem is #P-complete. An interesting feature of the dichotomy, absent from related dichotomy results, is the rich supply of tractable graphs?. with complex structure.作者: jabber 時(shí)間: 2025-3-23 18:21 作者: Nucleate 時(shí)間: 2025-3-23 23:46 作者: inspiration 時(shí)間: 2025-3-24 02:55 作者: OTHER 時(shí)間: 2025-3-24 09:13
Stopping Times, Metrics and Approximate Countingmetric which allows us to analyse a one-step path coupling. This approach provides insight for the design of better metrics for specific problems. We give illustrative applications to hypergraph independent sets and SAT instances, hypergraph colourings and colourings of bipartite graphs, obtaining improved results for all these problems.作者: CLASP 時(shí)間: 2025-3-24 13:42
Algebraic Characterization of the Finite Power Propertyonoids defined by a confluent regular system of deletion rules. This result in particular covers the case of free groups solved earlier by d’Alessandro and Sakarovitch by means of an involved reduction to the boundedness problem for distance automata.作者: Senescent 時(shí)間: 2025-3-24 18:31
Expressive Power of Pebble Automatac (resp.?deterministic) tree-walking automata with . + 1 pebbles can recognize more languages than those with . pebbles. Moreover, there is a regular tree language that is not recognized by any tree-walking automaton with pebbles. As a consequence, FO+posTC is strictly included in MSO over trees.作者: acquisition 時(shí)間: 2025-3-24 21:34 作者: conference 時(shí)間: 2025-3-25 00:35
Handbuch der Lebensmittelchemies in any MST of .. We use a lower bound given by a linear programming relaxation to the problem and strengthen known graph-theoretic results on minimum degree subgraphs [3,5] to prove our result. Previous results for the problem [1,4] used a combinatorial lower bound which is weaker than the LP bound we use.作者: 善辯 時(shí)間: 2025-3-25 05:39 作者: Fecundity 時(shí)間: 2025-3-25 11:31
Edge Disjoint Paths in Moderately Connected Graphsspecial structure (e.g., they exclude minors) or there are large numbers of short disjoint paths. Our algorithm extends previous techniques in that it applies to graphs with high diameters and asymptotically large minors.作者: Vasodilation 時(shí)間: 2025-3-25 11:45 作者: 障礙 時(shí)間: 2025-3-25 16:33
Getreide / Hülsenfrüchte / Hopfen und Malztractor which can extract .=.–.(log(1/.)) bits whenever .=.(.+log(./.)). Finally, we show that even to extract from bit-fixing sources, any extractor, seeded or not, must suffer an entropy loss .–. = Ω(log(1/.)). This generalizes a lower bound of Radhakrishnan & Ta-Shma with respect to general sourc作者: cravat 時(shí)間: 2025-3-25 23:30
,Ausl?ndische Lebensmittelgesetze,he case of non-uniform degree bounds..The crux of our solution is an approximation algorithm for the related problem of finding a minimum spanning tree (MST) in which the maximum degree of the nodes is minimized, a problem we call the minimum-degree MST (MDMST) problem. Given a graph . for which the作者: 留戀 時(shí)間: 2025-3-26 03:29
Testing Graph Isomorphism in Parallel by Playing a Game we obtain an AC. algorithm for testing isomorphism of rotation systems (combinatorial specifications of graph embeddings). The AC. upper bound was known before, but the fact that this bound can be achieved by the simple WL algorithm is new. Combined with other known results, it also yields a new AC作者: Intellectual 時(shí)間: 2025-3-26 05:25 作者: 地名詞典 時(shí)間: 2025-3-26 11:26 作者: Expiration 時(shí)間: 2025-3-26 16:40 作者: Serenity 時(shí)間: 2025-3-26 20:12
0302-9743 Overview: 978-3-540-35904-3978-3-540-35905-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Memorial 時(shí)間: 2025-3-26 23:54 作者: Injunction 時(shí)間: 2025-3-27 02:57 作者: 乳白光 時(shí)間: 2025-3-27 08:29 作者: 割公牛膨脹 時(shí)間: 2025-3-27 11:41 作者: 高度 時(shí)間: 2025-3-27 14:46
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166201.jpg作者: 無(wú)法解釋 時(shí)間: 2025-3-27 20:16 作者: Angiogenesis 時(shí)間: 2025-3-28 01:01
Ergebnisse der schriftlichen Befragung, fast parallel algorithm. More precisely, we prove that if every graph in . is definable in a finite-variable first order logic with counting quantifiers within logarithmic quantifier depth, then Graph Isomorphism for . is in .. If no counting quantifiers are needed, then Graph Isomorphism for . is 作者: Feigned 時(shí)間: 2025-3-28 05:53
Ergebnisse der qualitativen Interviews,as a large subgraph core(.(.,.)) such that the spectral gap of the normalized Laplacian of core(.(.,.)) is . with high probability; here ..>0 is a constant, and . signifies the minimum expected degree. This result is of interest in order to extend known spectral heuristics for random regular graphs 作者: 愛管閑事 時(shí)間: 2025-3-28 10:08
Ergebnisse der schriftlichen Befragung,arameter called ., which is very similar to (but more restrictive than) treewidth. This represents the first constant distortion embedding of a non-planar class of graphs into ?.. Our results make use of a new technique that we call . in which we define coordinates for a small number of points at a 作者: ESPY 時(shí)間: 2025-3-28 10:56
Ergebnisse der qualitativen Interviews, given an input digraph ., to determine how many homomorphisms there are from . to .. We give a graph-theoretic classification, showing that for some digraphs ., the problem is in P and for the rest of the digraphs . the problem is #P-complete. An interesting feature of the dichotomy, absent from re作者: Affiliation 時(shí)間: 2025-3-28 17:00
https://doi.org/10.1007/978-90-368-2539-9h noise thresholds are frequently estimated for the Steane seven-qubit, distance-three quantum code, there has been no proof that a constant threshold even exists for distance-three codes. We prove the existence of a constant threshold. The proven threshold is well below estimates, based on simulati作者: OUTRE 時(shí)間: 2025-3-28 19:57 作者: 幼稚 時(shí)間: 2025-3-29 02:49
Emanuel Rogenhofer,Viktor Mouckated set of quantum devices..To achieve our goal we define the notions of simulation and equivalence. Using these two concepts, we construct sets of simulation conditions which imply that the physical device of interest is equivalent to the one it is supposed to implement. Another benefit of our form作者: nutrients 時(shí)間: 2025-3-29 06:27 作者: 貞潔 時(shí)間: 2025-3-29 08:05
Getreide, Mais und Futtergr?serstraint graph ., so that if every assignment in . leaves an .-fraction of the edges unsatisfied, then in .. every assignment leaves an Ω(.)-fraction of the edges unsatisfied, that is, it amplifies the gap by a factor Ω(.). The corresponding result in [4] showed that one could amplify the gap by a fa作者: 不可思議 時(shí)間: 2025-3-29 11:46 作者: consolidate 時(shí)間: 2025-3-29 17:56
https://doi.org/10.1007/978-3-642-70917-3use this characterization to obtain a short elementary proof for the uniform decidability of the finite power property for rational languages in all monoids defined by a confluent regular system of deletion rules. This result in particular covers the case of free groups solved earlier by d’Alessandr作者: Stagger 時(shí)間: 2025-3-29 20:20
Krankheiten und Besch?digungen an Maisates deterministic Turing machines in polynomial time. As a corollary we find that the small universal Turing machines of Mathew Cook run in polynomial time, this is an exponential improvement on their previously known simulation time overhead.作者: enormous 時(shí)間: 2025-3-30 00:38
Handbuch der Lebensmittelchemief pebbles, the two models have the same expressive power both in the deterministic case and in the nondeterministic case. Furthermore, nondeterministic (resp.?deterministic) tree-walking automata with . + 1 pebbles can recognize more languages than those with . pebbles. Moreover, there is a regular 作者: Pantry 時(shí)間: 2025-3-30 05:43 作者: 單獨(dú) 時(shí)間: 2025-3-30 12:07 作者: Ligament 時(shí)間: 2025-3-30 13:44
,Ausl?ndische Lebensmittelgesetze,g the spanning trees with maximum degree .. This bi-criteria optimization problem generalizes several combinatorial problems, including the Traveling Salesman Path Problem (TSPP)..An .-approximation algorithm for the BDMST problem produces a spanning tree that has maximum degree .(.) and cost within作者: BANAL 時(shí)間: 2025-3-30 18:52 作者: 強(qiáng)制令 時(shí)間: 2025-3-30 23:29 作者: idiopathic 時(shí)間: 2025-3-31 03:42
Embedding Bounded Bandwidth Graphs into ?1arameter called ., which is very similar to (but more restrictive than) treewidth. This represents the first constant distortion embedding of a non-planar class of graphs into ?.. Our results make use of a new technique that we call . in which we define coordinates for a small number of points at a time.作者: ensemble 時(shí)間: 2025-3-31 08:04 作者: amplitude 時(shí)間: 2025-3-31 11:31
Better Algorithms for Minimizing Average Flow-Time on Related Machinesompetitive algorithm for the online version. This improves upon the previous best bound of .(log.. log.) on the competitive ratio. Here . is the ratio of the maximum to the minimum processing time of a job and . is the ratio of the maximum to the minimum speed of a machine.作者: Indelible 時(shí)間: 2025-3-31 15:49
https://doi.org/10.1007/11786986Automat; algorithms; automata; complexity; data structures; formal language; formal languages; game theory; 作者: 無(wú)法治愈 時(shí)間: 2025-3-31 19:16 作者: gospel 時(shí)間: 2025-3-31 22:55 作者: Spina-Bifida 時(shí)間: 2025-4-1 04:27
Small Sweeping 2NFAs Are Not Closed Under ComplementA two-way nondeterministic finite automaton is . (.) if its input head can change direction only on the end-markers. For every ., we exhibit a language that can be recognized by an .-state . but requires . states on every . recognizing its complement.
