找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Operations Research and Discrete Analysis; Alekseĭ D. Korshunov Book 1997 Springer Science+Business Media Dordrecht 1997 Boolean function.

[复制链接]
楼主: Encounter
发表于 2025-3-27 00:56:40 | 显示全部楼层
发表于 2025-3-27 04:00:04 | 显示全部楼层
Nonstrict Vector Summation in the Plane and its Applications to Scheduling Problems,addressed: Given such family of vectors in the plane, when does there exist a permutation of the vectors such that for any two successive partial sums of the vectors specified by the permutation at least one of them belongs to a given domain . ? (Such a summation is called “nonstrict.”) It is shown
发表于 2025-3-27 06:15:58 | 显示全部楼层
Edge Neighborhoods in Normal Maps, 4 4 5). Some of the parameters here may be improved..In the present paper, a similar problem is solved for the normal maps on the torus (Theorem 1), and it is established (Theorem 2) that sufficiently large normal maps on arbitrary orientable surfaces have the same structure as those torroidal.
发表于 2025-3-27 13:29:01 | 显示全部楼层
Dynamic Problems of Choosing Optimal Composition of a System of Technical Tools,n which the production cost depends nonlinearly on the total output and additional restrictions on the composition of the system of technical tools. Suppose that during a certain planned period it is necessary to fulfill a given set of jobs. For fulfillment of the jobs there is a system of technical tools.
发表于 2025-3-27 15:37:01 | 显示全部楼层
Effective Algorithms for Solving Multi-Level Plant Location Problem,on problems (MPLP) [1 – 5]. This class of problems can be characterized by presence of several levels of production in which raw material is processed before the finished product arrives to a consumer. An example of the two-level production process is the mining and the treatment of natural raw material: petroleum, ore, etc.
发表于 2025-3-27 18:20:39 | 显示全部楼层
发表于 2025-3-28 00:48:36 | 显示全部楼层
On Comparison Between the Sizes of Read-,-Times Branching Programs,ead-.-times branching programs in an exponential number of times exceeds the complexity of computation of the same function by read-s . -times branching programs (with respect to the number of variables of the Boolean function). We can take . as ... A more precise estimate for ... will be given before Lemma 5.
发表于 2025-3-28 06:04:17 | 显示全部楼层
发表于 2025-3-28 08:08:26 | 显示全部楼层
第4楼
发表于 2025-3-28 13:27:28 | 显示全部楼层
5楼
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-2 09:36
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表