標(biāo)題: Titlebook: Mathematical Foundations of Computer Science 2014; 39th International S Erzsébet Csuhaj-Varjú,Martin Dietzfelbinger,Zoltán Conference proce [打印本頁(yè)] 作者: Flippant 時(shí)間: 2025-3-21 17:11
書(shū)目名稱Mathematical Foundations of Computer Science 2014影響因子(影響力)
書(shū)目名稱Mathematical Foundations of Computer Science 2014影響因子(影響力)學(xué)科排名
書(shū)目名稱Mathematical Foundations of Computer Science 2014網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Mathematical Foundations of Computer Science 2014網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Mathematical Foundations of Computer Science 2014被引頻次
書(shū)目名稱Mathematical Foundations of Computer Science 2014被引頻次學(xué)科排名
書(shū)目名稱Mathematical Foundations of Computer Science 2014年度引用
書(shū)目名稱Mathematical Foundations of Computer Science 2014年度引用學(xué)科排名
書(shū)目名稱Mathematical Foundations of Computer Science 2014讀者反饋
書(shū)目名稱Mathematical Foundations of Computer Science 2014讀者反饋學(xué)科排名
作者: happiness 時(shí)間: 2025-3-21 20:57
A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivitye important, as it precludes achieving a superquadratic separation between .(.) and .(.) by iterating functions which reach this bound. In addition, this bound is tight, as it matches the construction of Ambainis and Sun [3] up to an additive constant.作者: sultry 時(shí)間: 2025-3-22 04:24 作者: Statins 時(shí)間: 2025-3-22 07:03
Network-Based Dissolutionleted, and the relation between old and new vertex loads influence the computational complexity of the underlying graph problems. Our results establish a clear borderline between tractable and intractable cases.作者: diathermy 時(shí)間: 2025-3-22 10:13 作者: 訓(xùn)誡 時(shí)間: 2025-3-22 13:00 作者: 宴會(huì) 時(shí)間: 2025-3-22 20:21
Combinatorial Voter Control in Elections In our setting, when we choose to add a voter?., we also have to add a whole bundle .(.) of voters associated with .. We study the computational complexity of this problem for two of the most basic voting rules, namely the Plurality rule and the Condorcet rule.作者: Parameter 時(shí)間: 2025-3-22 21:33 作者: arboretum 時(shí)間: 2025-3-23 01:31
0302-9743 amming, Algorithms, Complexity, Parallel and Distributed Computing, Quantum Computing, Automata, Grammars and Formal Languages, Combinatorics on Words, Trees and Games.978-3-662-44464-1978-3-662-44465-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Lobotomy 時(shí)間: 2025-3-23 07:26 作者: Enrage 時(shí)間: 2025-3-23 12:33
0302-9743 cal Foundations of Computer Science, MFCS 2014, held in Budapest, Hungary, in August 2014. The 95 revised full papers presented together with 6 invited talks were carefully selected from 270 submissions. The focus of the conference was on following topics: Logic, Semantics, Automata, Theory of Progr作者: 開(kāi)玩笑 時(shí)間: 2025-3-23 14:16
The Price of Envy-Freeness in Machine Schedulingation ratio for the minimum makespan problem guaranteed by a polynomial time algorithm for each specific model. Finally, we extend our results to the case of restricted assignments and to the objective of minimizing the sum of the completion times of all the machines.作者: 做方舟 時(shí)間: 2025-3-23 20:21 作者: COLIC 時(shí)間: 2025-3-24 00:38 作者: Offset 時(shí)間: 2025-3-24 03:24 作者: Creatinine-Test 時(shí)間: 2025-3-24 08:46 作者: 拍下盜公款 時(shí)間: 2025-3-24 13:57 作者: 浸軟 時(shí)間: 2025-3-24 15:58 作者: 相符 時(shí)間: 2025-3-24 19:13 作者: 正式通知 時(shí)間: 2025-3-25 01:45
Mathematical Foundations of Computer Science 2014978-3-662-44465-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: multiply 時(shí)間: 2025-3-25 05:10 作者: 易碎 時(shí)間: 2025-3-25 10:20 作者: Diaphragm 時(shí)間: 2025-3-25 13:30
nalysemethoden. Auf Grund der herausragenden Bedeutung des Faktors "Wissen" in der betriebswirtschaftlichen Praxis findet Data-Mining - insbesondere bei Marketingfragestellungen - zunehmend Anwendung...In "Neuronale Netze im Marketing-Management" liefern erstmalig deutschsprachige Autoren einen über作者: 溫室 時(shí)間: 2025-3-25 16:22 作者: 同步信息 時(shí)間: 2025-3-25 21:24
Eric Allender,Nikhil Balaji,Samir Dattanalysemethoden. Auf Grund der herausragenden Bedeutung des Faktors "Wissen" in der betriebswirtschaftlichen Praxis findet Data-Mining - insbesondere bei Marketingfragestellungen - zunehmend Anwendung...In "Neuronale Netze im Marketing-Management" liefern erstmalig deutschsprachige Autoren einen über作者: MOCK 時(shí)間: 2025-3-26 03:11 作者: Abnormal 時(shí)間: 2025-3-26 08:02
Andris Ambainis,Kri?jānis Prūsisn. demonstriert worden. überlicherweise unterscheidet man die Erkl?rungsans?tze von Zeitreihen in einen ?konometrischen und einen statistischen Ansatz. Der ?konometrische Ansatz versucht die zu erkl?rende Gr??e (endogen Variable) mit unabh?ngigen Variablen (exogene Variable) zu beschreiben. Dabei ob作者: curriculum 時(shí)間: 2025-3-26 12:17
Tetsuo Asano,David Kirkpatrick,Kotaro Nakagawa,Osamu Watanaberen Beziehungen untereinander h?chst probabilistischer Natur sind und die daher mit deterministischen Regeln nicht erkl?rt werden k?nnen. Es ist deshalb im Prinzip unm?glich, zukünftige finanzwirtschaftliehe Entwicklungen verl??lich vorherzusagen; es scheint, da? die einzige sichere Prognose ist, da作者: FATAL 時(shí)間: 2025-3-26 15:31
Joan Boyar,Magnus Gausdal Findinsatzm?glich- keiten Neuronaler Netze, heute sind sie aus vielen Gesch?ftsbereichen der Kredit- institute nicht mehr wegzudenken. Die meisten (deutschen) Banken, in denen diese Technologie zum Einsatz kommt, haben entweder schon eine Anwendung (oder auch mehrere) realisiert oder sind gerade dabei, 作者: acclimate 時(shí)間: 2025-3-26 18:59 作者: 無(wú)力更進(jìn) 時(shí)間: 2025-3-26 23:28 作者: cardiovascular 時(shí)間: 2025-3-27 02:35 作者: allude 時(shí)間: 2025-3-27 06:33
A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivityby Nisan and Szegedy [7], is whether sensitivity and block sensitivity are polynomially related. Motivated by the constructions of functions which achieve the largest known separations, we study the relation between 1-certificate complexity and 0-sensitivity and 0-block sensitivity..Previously the b作者: 招人嫉妒 時(shí)間: 2025-3-27 11:01
-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachabilityblem is to determine whether there exists a path from .. to .. in .. The main result of this paper is to show that the directed graph reachability problem restricted to planar graphs can be solved in polynomial time using only . space.作者: 過(guò)分自信 時(shí)間: 2025-3-27 16:46 作者: 該得 時(shí)間: 2025-3-27 19:26
Network-Based Dissolutionor work balancing in an online situation. The central aspect of our model is the deletion of certain vertices and the redistribution of their loads to neighboring vertices in a perfectly balanced way..We investigate how the underlying graph structure, the pre-knowledge of which vertices should be de作者: laxative 時(shí)間: 2025-3-28 00:35 作者: DECRY 時(shí)間: 2025-3-28 02:46
Minimum Planar Multi-sink Cuts with Connectivity Priorst in . corresponds to a cycle or a collection of edge-disjoint cycles in the planar dual graph .. that define a planar region containing . but not .. A cut with a connectivity prior does not separate the vertices in . from each other: we focus on the most natural prior where the cut corresponds to a作者: CROW 時(shí)間: 2025-3-28 08:31 作者: 故意釣到白楊 時(shí)間: 2025-3-28 11:36
On the Complexity of Some Ordering Problemsplications work with a restricted variant called complete OBDDs. This model has also been investigated in complexity theory, e.g., in property testing. It is well-known that the size of an OBDD for the representation of a given function may depend significantly on the chosen variable ordering but th作者: 善于騙人 時(shí)間: 2025-3-28 17:04 作者: Keratectomy 時(shí)間: 2025-3-28 19:22
Let . be an edge-bicolored graph where each etaneously satisfies given properties for .’s red graph and blue graph. In particular, we consider . problem — find from . a .-vertex induced subgraph whose red and blue graphs are both connected, and . problem — delete at most . vertices to simultaneously disconnect red and blue graphs of ...We will作者: Flirtatious 時(shí)間: 2025-3-28 23:54 作者: 錢(qián)財(cái) 時(shí)間: 2025-3-29 05:42 作者: 解凍 時(shí)間: 2025-3-29 08:20
On the Limits of Depth Reduction at Depth 3 Over Small Finite Fieldsepth three ∑?∏?∑ circuit of size . . Over fixed-size finite fields, Grigoriev and Karpinski proved that any ∑?∏?∑ circuit that computes the determinant (or the permanent) polynomial of a .×. matrix must be of size 2.. In this paper, for an explicit polynomial in VP (over fixed-size finite fields), w作者: 涂掉 時(shí)間: 2025-3-29 12:47
Hitting Forbidden Subgraphs in Graphs of Bounded Treewidthset .???.(.) that hits all subgraphs of . isomorphic to .. In the colorful variant of the problem, each vertex of . is precolored with some color from .(.) and we require to hit only .-subgraphs with matching colors. Standard techniques (e.g., Courcelle’s theorem) show that, for every fixed . and th作者: gusher 時(shí)間: 2025-3-29 19:21 作者: 放肆的我 時(shí)間: 2025-3-29 22:04 作者: CLOT 時(shí)間: 2025-3-30 02:07 作者: 外面 時(shí)間: 2025-3-30 05:33
On the Complexity of Some Ordering Problemstex encoding is of additional importance to represent a given input graph in small size. The computational complexity of the vertex encoding problem is unknown but in the paper a first step is done to determine its complexity by showing that a restricted case is NP-hard.作者: lactic 時(shí)間: 2025-3-30 12:13
On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields size 2...We also give an example of an explicit polynomial (NW.(X)) in VNP (which is not known to be in VP), for which any ∑?∏?∑ circuit computing it (over fixed-size fields) must be of size 2.. The polynomial we consider is constructed from the combinatorial design of Nisan and Wigderson [NW94], a作者: 奴才 時(shí)間: 2025-3-30 12:46
Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth colorful problem can be solved in time ., but cannot be solved in time ., assuming the Exponential Time Hypothesis (ETH). Furthermore, we give some preliminary results showing that, in the absence of colors, the parameterized complexity landscape of .. is much richer.作者: 有機(jī)體 時(shí)間: 2025-3-30 18:20 作者: 使習(xí)慣于 時(shí)間: 2025-3-30 22:34
r im Marketingbereich sowie Dozenten und Studenten der Betriebswirtschaftslehre mit den Schwerpunkten Wirtschaftsinformatik und Marketing...Prof. Dr. Klaus-Peter Wiedmann ist Inhaber des Lehrstuhls Marketing II an der Universit?t Hannover..Dr978-3-409-21673-9978-3-663-10897-9作者: DEMN 時(shí)間: 2025-3-31 03:55
Eric Allender,Nikhil Balaji,Samir Dattar im Marketingbereich sowie Dozenten und Studenten der Betriebswirtschaftslehre mit den Schwerpunkten Wirtschaftsinformatik und Marketing...Prof. Dr. Klaus-Peter Wiedmann ist Inhaber des Lehrstuhls Marketing II an der Universit?t Hannover..Dr978-3-409-21673-9978-3-663-10897-9作者: BOOM 時(shí)間: 2025-3-31 06:51 作者: 受人支配 時(shí)間: 2025-3-31 10:13
Hasan Abasi,Nader H. Bshouty,Ariel Gabizon,Elad Haramatyer Strukturgleichungen, wie es in den Sozialwissenschaften bisweilen versucht wird (vgl. Blau & Duncan 1967, Duncan 1966, 1975), erfordert jedoch einen hohen Kenntnisstand in soziologischer Theorie und ist nur schwer für praktische Belange des Marketings zu nutzen. Neuronale Netze geh?ren demgegenüb作者: 極為憤怒 時(shí)間: 2025-3-31 14:24 作者: 晚來(lái)的提名 時(shí)間: 2025-3-31 20:46
Andris Ambainis,Kri?jānis Prūsis? sie über die Zeit hinweg invariant oder zumindest n?herungsweise konstant ist, so da? mit Hilfe der Daten Prognosewerte gesch?tzt werden k?nnen. Die Hypothese der Strukturbest?ndigkeit in einer noch unbekannten Zukunft setzten sowohl neuronale Netze als auch statistische Modelle voraus.作者: 青春期 時(shí)間: 2025-3-31 21:41 作者: 生意行為 時(shí)間: 2025-4-1 04:17 作者: Galactogogue 時(shí)間: 2025-4-1 06:34
Rémy Belmonte,Pim van ’t Hof,Marcin Kamiński,Dani?l Paulusma作者: 厚臉皮 時(shí)間: 2025-4-1 12:38
René van Bevern,Robert Bredereck,Jiehua Chen,Vincent Froese,Rolf Niedermeier,Gerhard J. Woeginger作者: 過(guò)多 時(shí)間: 2025-4-1 15:10 作者: Incisor 時(shí)間: 2025-4-1 20:05
Jiehua Chen,Piotr Faliszewski,Rolf Niedermeier,Nimrod Talmon作者: jaundiced 時(shí)間: 2025-4-1 23:31 作者: 搜集 時(shí)間: 2025-4-2 03:41
