標(biāo)題: Titlebook: Exploring New Frontiers of Theoretical Informatics; IFIP 18th World Comp Jean-Jacques Levy,Ernst W. Mayr,John C. Mitchell Conference procee [打印本頁] 作者: tricuspid-valve 時間: 2025-3-21 17:27
書目名稱Exploring New Frontiers of Theoretical Informatics影響因子(影響力)
書目名稱Exploring New Frontiers of Theoretical Informatics影響因子(影響力)學(xué)科排名
書目名稱Exploring New Frontiers of Theoretical Informatics網(wǎng)絡(luò)公開度
書目名稱Exploring New Frontiers of Theoretical Informatics網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Exploring New Frontiers of Theoretical Informatics被引頻次
書目名稱Exploring New Frontiers of Theoretical Informatics被引頻次學(xué)科排名
書目名稱Exploring New Frontiers of Theoretical Informatics年度引用
書目名稱Exploring New Frontiers of Theoretical Informatics年度引用學(xué)科排名
書目名稱Exploring New Frontiers of Theoretical Informatics讀者反饋
書目名稱Exploring New Frontiers of Theoretical Informatics讀者反饋學(xué)科排名
作者: 參考書目 時間: 2025-3-21 23:02 作者: Blanch 時間: 2025-3-22 03:59
https://doi.org/10.1007/b98989algorithms; complexity; computer; computer science; information processing; programming; verification作者: 無法破譯 時間: 2025-3-22 06:11
https://doi.org/10.1007/978-1-4020-5727-4 notions: strong immunity, almost immunity, and hyperimmunity as well as their corresponding simplicity notions. We also study .-. and .-. and their extensions: feasible .-. and feasible .-.. Finally, we propose the .-. hypothesis as a working hypothesis that ensures the existence of simple sets in NP.作者: resilience 時間: 2025-3-22 08:46
https://doi.org/10.1007/978-94-011-0978-9world, (non)uniform gap-definability, and relativized separations. This way, we settle certain open questions of Hemaspaandra, Ramachandran & Zimand [HRZ95 ] and Fenner, Fortnow & Kurtz [FFK94], extend results of Hemaspaandra, Jain & Vereshchagin [HJV93] and construct oracles achieving desired results.作者: 積云 時間: 2025-3-22 14:52
Fresnel and the principle of interference,ory algorithms for this problem and needs a factor of at least four less I/Os for realistic inputs..Our implementation indicates that this algorithm processes graphs only limited by the disk capacity of most current machines in time no more than a factor 2–5 of a good internal algorithm with sufficient memory space.作者: 積云 時間: 2025-3-22 20:04
Resource Bounded Immunity and Simplicity notions: strong immunity, almost immunity, and hyperimmunity as well as their corresponding simplicity notions. We also study .-. and .-. and their extensions: feasible .-. and feasible .-.. Finally, we propose the .-. hypothesis as a working hypothesis that ensures the existence of simple sets in NP.作者: dura-mater 時間: 2025-3-22 23:38
Degree Bounds on Polynomials and Relativization Theoryworld, (non)uniform gap-definability, and relativized separations. This way, we settle certain open questions of Hemaspaandra, Ramachandran & Zimand [HRZ95 ] and Fenner, Fortnow & Kurtz [FFK94], extend results of Hemaspaandra, Jain & Vereshchagin [HJV93] and construct oracles achieving desired results.作者: 得意人 時間: 2025-3-23 03:46
Engineering an External Memory Minimum Spanning Tree Algorithmory algorithms for this problem and needs a factor of at least four less I/Os for realistic inputs..Our implementation indicates that this algorithm processes graphs only limited by the disk capacity of most current machines in time no more than a factor 2–5 of a good internal algorithm with sufficient memory space.作者: 朝圣者 時間: 2025-3-23 06:54
Hellenic and Alexandrian Philosophypect to this parametrization. When the approximation ratio grows with the parameter, but is independent of the size of the instances,then we speak about stable approximation algorithms. An interesting point is that there exist stable approximation algorithms for problems like TSP that is not approxi作者: adhesive 時間: 2025-3-23 10:21
Educational Activities in the Society,g encryption and key generation processes. After some simple but rather cumbersome substitutions, we should obtain two new systems .. and ... .. has 16 very dense equations of degree up to 255 in each of its 16 variables. With a single pair (.), with . a cleartext and . its encryption, its roots giv作者: 公社 時間: 2025-3-23 17:02
Purabi Mukherji,Atri Mukhopadhyayty for all applications. In this paper, we present a scheme which removes the key escrow from the IBE system proposed by Bonch and Franklin, while at the same time maintaining some important properties of the IBE. We also present some cryptosystems based on our variant including a signature scheme a作者: deface 時間: 2025-3-23 21:07 作者: 阻擋 時間: 2025-3-24 01:23
https://doi.org/10.1007/3-540-34888-3block cyphers. In 1980, Toffoli showed how to realize a Boolean function by a reversible circuit, however the resulting complexity of such circuits has remained an open problem. We investigate the reversible circuit complexity of families of Boolean functions and derive conditions that characterize 作者: NOTCH 時間: 2025-3-24 04:57 作者: 創(chuàng)新 時間: 2025-3-24 09:30
https://doi.org/10.1007/978-94-011-0978-9world, (non)uniform gap-definability, and relativized separations. This way, we settle certain open questions of Hemaspaandra, Ramachandran & Zimand [HRZ95 ] and Fenner, Fortnow & Kurtz [FFK94], extend results of Hemaspaandra, Jain & Vereshchagin [HJV93] and construct oracles achieving desired resul作者: hysterectomy 時間: 2025-3-24 11:58
Kazuhiko Yago,Yoshio Asai,Masanao Itoheneral. A synchronous and an asynchronous version of the problem are considered. In the latter case the generals may start their activities at different times. In the synchronous case there are optimumtime solutions. Very simple and elegant techniques for constructing one of them are the main contri作者: acquisition 時間: 2025-3-24 15:35 作者: 變化 時間: 2025-3-24 19:33 作者: anthropologist 時間: 2025-3-25 03:05
Ivor Grattan-Guinness,B. S. Yadavsence of a single link failure: if the shortest path is not affected by the failed link, then the message will be delivered through that path; otherwise, the system will guarantee that, when the message reaches the node where the failure has occurred, the message will then be rerouted through the sh作者: syncope 時間: 2025-3-25 03:47
https://doi.org/10.1007/978-1-4615-0555-6n and whose agents’ utilities are not quasi-linear. We provide a generalization of utilitarian problems,termed . problems, and prove that every consistent problem admits a .. These mechanisms,termed . (VCGc) mechanisms,can be seen as a natural extension of VCG mechanisms for utilitarian problems..We作者: palette 時間: 2025-3-25 08:11 作者: Irksome 時間: 2025-3-25 13:40 作者: insincerity 時間: 2025-3-25 18:11 作者: FUSE 時間: 2025-3-25 21:54
https://doi.org/10.1007/978-3-030-85117-0al packing and covering problem:find . such that .. where .. are vectors with . nonnegative convex and concave functions, . and . are . - dimensional nonnegative vectors and . is a convex set that can be queried by an optimization or feasibility oracle. We propose an algorithm that needs only .... i作者: artless 時間: 2025-3-26 02:04
IFIP Advances in Information and Communication Technologyhttp://image.papertrans.cn/e/image/319545.jpg作者: facetious 時間: 2025-3-26 05:11
History of the Japanese Video Game Industryatus. When the PPS has buffers in its input-ports, an .. lower bound holds if the demultiplexing algorithm uses only local information, or the input buffers are small relative to the time an input-port needs to learn the switch global information.作者: 捏造 時間: 2025-3-26 09:02
https://doi.org/10.1007/978-1-4615-0555-6 of these three classes is straightforward, thus yielding a simple way to see whether VCGc mechanisms are appropriate or not..Finally, we apply our results to a number of basic non-utilitarian problems.作者: 符合規(guī)定 時間: 2025-3-26 13:58
The Inherent Queuing Delay of Parallel Packet Switchesatus. When the PPS has buffers in its input-ports, an .. lower bound holds if the demultiplexing algorithm uses only local information, or the input buffers are small relative to the time an input-port needs to learn the switch global information.作者: 涂掉 時間: 2025-3-26 19:32
Truthful Mechanisms for Generalized Utilitarian Problems of these three classes is straightforward, thus yielding a simple way to see whether VCGc mechanisms are appropriate or not..Finally, we apply our results to a number of basic non-utilitarian problems.作者: 收藏品 時間: 2025-3-27 00:58 作者: Dungeon 時間: 2025-3-27 01:12 作者: Inflammation 時間: 2025-3-27 07:25 作者: headlong 時間: 2025-3-27 09:28
Conference proceedings 2004ge-scale distributed programming, high bandwidth communications are inexpensive and widespread, and most of our work tools are equipped with processors enabling us to perform a multitude of tasks. In addition, mobile computing (referring specifically to wireless devices and, more broadly, to dynamic作者: Ethics 時間: 2025-3-27 15:21 作者: 首創(chuàng)精神 時間: 2025-3-27 18:59
Scheduling With Release Times and Deadlines on A Minimum Number of Machinessisting of jobs with slack at most one can be solved efficiently. We close the resulting gap by showing that the problem already becomes .-. if slacks up to 2 are allowed. Additionally, we consider several variants of the SRDM problem and provide exact and approximation algorithms.作者: Talkative 時間: 2025-3-27 22:39
The Origins and Spread of , Chan is constant on them and combines such flats to flats of higher dimension in a second phase. This way, the algorithm is much faster than exhaustive search. Moreover, the algorithm benefits from randomising the first phase. In addition, by evaluating several flats implicitly in parallel, the time-complexity of the algorithm decreases further.作者: ablate 時間: 2025-3-28 04:44
Kazuhiko Yago,Yoshio Asai,Masanao Itohbution of this paper on the algorithmic side. For the asynchronous case an exact formula for the optimum synchronization time of each instance is derived. We prove that no CA can solve all instances in optimum time, but we describe a CA whose running time is very close to it; it only needs additional .. steps.作者: 暫時中止 時間: 2025-3-28 09:20 作者: rheumatism 時間: 2025-3-28 10:53 作者: Cpr951 時間: 2025-3-28 14:58
A Randomised Algorithm for Checking The Normality of Cryptographic Boolean Functions is constant on them and combines such flats to flats of higher dimension in a second phase. This way, the algorithm is much faster than exhaustive search. Moreover, the algorithm benefits from randomising the first phase. In addition, by evaluating several flats implicitly in parallel, the time-complexity of the algorithm decreases further.作者: 脫水 時間: 2025-3-28 20:16
The Firing Squad Synchronization Problem with Many Generals for One-Dimensional CAbution of this paper on the algorithmic side. For the asynchronous case an exact formula for the optimum synchronization time of each instance is derived. We prove that no CA can solve all instances in optimum time, but we describe a CA whose running time is very close to it; it only needs additional .. steps.作者: corpus-callosum 時間: 2025-3-29 00:30 作者: anachronistic 時間: 2025-3-29 04:31
Approximation Algorithms for Mixed Fractional Packing and Covering Problemsterations or calls to the oracle. The main contribution is that the algorithm solves the general mixed fractional packing and covering problem (in contrast to pure fractional packing and covering problems and to the special mixed packing and covering problem with ..) and runs in time independent of the so-called width of the problem.作者: 偶然 時間: 2025-3-29 10:06 作者: 清楚說話 時間: 2025-3-29 12:23
Remove key Escrow from the Identity-Based Encryption Systemthe same time maintaining some important properties of the IBE. We also present some cryptosystems based on our variant including a signature scheme and an authenticated key agreement. We finally show how to integrate our scheme into a hierarchial identity based public key encryption system.作者: 拋媚眼 時間: 2025-3-29 18:56
Stability of Approximation in Discrete Optimizationpect to this parametrization. When the approximation ratio grows with the parameter, but is independent of the size of the instances,then we speak about stable approximation algorithms. An interesting point is that there exist stable approximation algorithms for problems like TSP that is not approxi作者: Metastasis 時間: 2025-3-29 20:48
Looking Inside , and ,g encryption and key generation processes. After some simple but rather cumbersome substitutions, we should obtain two new systems .. and ... .. has 16 very dense equations of degree up to 255 in each of its 16 variables. With a single pair (.), with . a cleartext and . its encryption, its roots giv作者: cringe 時間: 2025-3-30 02:13
Remove key Escrow from the Identity-Based Encryption Systemty for all applications. In this paper, we present a scheme which removes the key escrow from the IBE system proposed by Bonch and Franklin, while at the same time maintaining some important properties of the IBE. We also present some cryptosystems based on our variant including a signature scheme a作者: 蒸發(fā) 時間: 2025-3-30 08:08
A Randomised Algorithm for Checking The Normality of Cryptographic Boolean Functionssystems. This paper presents an asymmetric Monte Carlo algorithm to determine whether a given Boolean function is normal. Our algorithm is far faster than the best known (deterministic) algorithm of Daum et al. In a first phase, it checks for flats of low dimension whether the given Boolean function作者: 配偶 時間: 2025-3-30 12:12
Reversible Circuit Realizations of Boolean Functionsblock cyphers. In 1980, Toffoli showed how to realize a Boolean function by a reversible circuit, however the resulting complexity of such circuits has remained an open problem. We investigate the reversible circuit complexity of families of Boolean functions and derive conditions that characterize 作者: 發(fā)源 時間: 2025-3-30 13:26 作者: 擴(kuò)音器 時間: 2025-3-30 20:33
Degree Bounds on Polynomials and Relativization Theoryworld, (non)uniform gap-definability, and relativized separations. This way, we settle certain open questions of Hemaspaandra, Ramachandran & Zimand [HRZ95 ] and Fenner, Fortnow & Kurtz [FFK94], extend results of Hemaspaandra, Jain & Vereshchagin [HJV93] and construct oracles achieving desired resul作者: 新鮮 時間: 2025-3-30 23:26 作者: 機(jī)警 時間: 2025-3-31 03:21
A Matrix Q-Analogue of the Parikh Mapepresents a word . over a .-. alphabet as a .-. upper-triangular matrix with entries that are nonnegative integral polynomials in variable .. We show that by appropriately embedding the .-. alphabet into the .+. alphabet and putting .=., we obtain the extension of the Parikh mapping to (.+. (numeric作者: FRET 時間: 2025-3-31 05:11
The Inherent Queuing Delay of Parallel Packet Switchesced by the PPS’s demultiplexing algorithm, relative to an optimal work-conserving switch..We show that the inherent queuing delay and delay jitter of a symmetric and fault-tolerant . PPS, where every demultiplexing algorithm dispatches cells to all the middle-stage switches is ., if there are no buf作者: OWL 時間: 2025-3-31 11:01 作者: 報復(fù) 時間: 2025-3-31 16:24
