標題: Titlebook: Operations Research and Discrete Analysis; Alekse? D. Korshunov Book 1997 Springer Science+Business Media Dordrecht 1997 Boolean function. [打印本頁] 作者: Encounter 時間: 2025-3-21 16:31
書目名稱Operations Research and Discrete Analysis影響因子(影響力)
書目名稱Operations Research and Discrete Analysis影響因子(影響力)學科排名
書目名稱Operations Research and Discrete Analysis網(wǎng)絡(luò)公開度
書目名稱Operations Research and Discrete Analysis網(wǎng)絡(luò)公開度學科排名
書目名稱Operations Research and Discrete Analysis被引頻次
書目名稱Operations Research and Discrete Analysis被引頻次學科排名
書目名稱Operations Research and Discrete Analysis年度引用
書目名稱Operations Research and Discrete Analysis年度引用學科排名
書目名稱Operations Research and Discrete Analysis讀者反饋
書目名稱Operations Research and Discrete Analysis讀者反饋學科排名
作者: 禁令 時間: 2025-3-21 22:42 作者: hematuria 時間: 2025-3-22 01:24 作者: delusion 時間: 2025-3-22 06:28 作者: nonradioactive 時間: 2025-3-22 09:35 作者: Negligible 時間: 2025-3-22 14:03
On Schedules of a Single Machine Jobs with Processing Times Nonlinear in Time,problem is NP- hard in the strong sense. The problem remains NP-hard even if we assume that the latest start times are the same for all the jobs, but in this case it can be solved by a pseudopolynomial algorithm.作者: 演繹 時間: 2025-3-22 19:05 作者: 頭腦冷靜 時間: 2025-3-22 21:37
The Maximum-Weight Traveling Salesman Problem in Finite-Dimensional Real Spaces, traveling salesman problem. A polynomial algorithm is proposed that solves the problem with any prescribed accuracy for sufficiently large . in finite-dimensional real spaces with a Minkowski metric. The problem is shown to be polynomially solvable in two dimensional polyhedral spaces whose unit ball is a triangle.作者: 神圣將軍 時間: 2025-3-23 01:25
On a Property of Perfect Binary Codes,It is proved that any perfect binary (., 3)-code is uniquely reconstructible from the allocation of its code vertices in the two medium layers of the .-dimensional unit cube. A nontrivial upper bound is obtained for the number of such codes.作者: 補角 時間: 2025-3-23 07:37 作者: Ossification 時間: 2025-3-23 11:46
Problems of Reconstructing Words from their Fragments and Applications,Problems of reconstructing words from their fragments and applications to image recognition and information theory are considered. A number of new results characterizing the possibilities of recognition and decoding in terms of combinatorial and geometric constructs is presented.作者: Occipital-Lobe 時間: 2025-3-23 13:53 作者: Dealing 時間: 2025-3-23 20:17
On Closed Classes in ,-Valued Logic which Contain a Homogeneous Switching Function,It is proved that for every k, k ≥ 2, in .-valued logic there exist only finitely many closed classes containing a homogeneous switching function . that equals . at ., equals . at ., and equals . in other cases. Every such class consists of all functions preserving a finite set of relations of three explicitly indicated types.作者: 苦惱 時間: 2025-3-24 00:06 作者: 季雨 時間: 2025-3-24 04:19 作者: nascent 時間: 2025-3-24 08:46
https://doi.org/10.1007/978-94-011-5678-3Boolean function; Graph; Sim; Variable; Vertices; algorithms; coding theory; combinatorics; complexity; compu作者: 尾巴 時間: 2025-3-24 11:46 作者: Paraplegia 時間: 2025-3-24 15:54
Overview: 978-94-010-6395-1978-94-011-5678-3作者: 沉積物 時間: 2025-3-24 20:36 作者: 憤世嫉俗者 時間: 2025-3-24 23:54 作者: DEI 時間: 2025-3-25 03:22 作者: effrontery 時間: 2025-3-25 11:14
Operations and Isometric Embeddings of Graphs Related to the Metric Prolongation Property,ies of the locally-isometric embeddings. In the present paper, we continue the study of the MPP for finite graphs [1 – 5]. Some operations invariant with respect to the MPP are considered whose application simplifies the study of the MPP for certain classes of graphs. A theorem is proved on the isom作者: 同步左右 時間: 2025-3-25 13:01 作者: 繼承人 時間: 2025-3-25 19:44
On the Complexity of Realization of Boolean Functions by Circuits Over an Infinite Basis,ean functions, i.e.,the functions taking the value 1 only at pairwise incomparable tuples. It is shown thatas . → ∞ the complexity of realization of a linear function of . arguments over thebasis . grows at least as (./ log .).. It is established that the maximal complexity of realization of Boolean作者: 委派 時間: 2025-3-25 20:49 作者: irradicable 時間: 2025-3-26 01:08
Lower Bounds in the Problem of Choosing an Optimal Composition of a Two-Level System of Technical Td. These bounds are constructed by using Lagrangian relaxations. Two bounds are obtained as a result of relaxing two different groups of restrictions. It is shown that these bounds can be found in polynomial time. For incomparable bounds, domination areas are identified.作者: 生氣地 時間: 2025-3-26 06:44 作者: floaters 時間: 2025-3-26 10:32
A Vertex Variant of the Kleitman-West Problem,the nth layer lying at distance 2 from . (i.e., in the frontier of .). Our main results are lower and upper bounds on the ratio of the size of the frontier to the size of the set and exact formulas for the size of the boundaries of ideals.作者: 忘川河 時間: 2025-3-26 14:02
On Comparison Between the Sizes of Read-,-Times Branching Programs,2, there exist a natural number .. and a sequence of Boolean functions such that the complexity of computation of every function of this sequence by read-.-times branching programs in an exponential number of times exceeds the complexity of computation of the same function by read-s . -times branchi作者: Commemorate 時間: 2025-3-26 20:42
Some Optimization Problems of Scheduling the Transmission of Messages in a Local Communication Netwcoloring of the edges in a directed multigraph with the least possible number of colors. Two algorithms for the latter problem are presented. The term “mixed coloring” means that some of the edges can be splitted into two parts and be colored in two colors so that the number of the color of the firs作者: Corral 時間: 2025-3-27 00:56 作者: 虛弱的神經(jīng) 時間: 2025-3-27 04:00
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
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.作者: BINGE 時間: 2025-3-27 13:29
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.作者: intrigue 時間: 2025-3-27 15:37
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 作者: 天真 時間: 2025-3-28 00:48
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.作者: FER 時間: 2025-3-28 06:04 作者: 濕潤 時間: 2025-3-28 08:08
第4樓作者: Misgiving 時間: 2025-3-28 13:27
5樓作者: 無所不知 時間: 2025-3-28 17:11
5樓作者: ATP861 時間: 2025-3-28 20:54
5樓作者: noxious 時間: 2025-3-29 00:28
5樓作者: Nuance 時間: 2025-3-29 06:15
6樓作者: capillaries 時間: 2025-3-29 10:27
6樓作者: BURSA 時間: 2025-3-29 13:11
6樓作者: Initial 時間: 2025-3-29 17:37
6樓作者: SAGE 時間: 2025-3-29 22:10
7樓作者: 謙卑 時間: 2025-3-30 01:14
7樓作者: 顯示 時間: 2025-3-30 05:11
7樓作者: Conjuction 時間: 2025-3-30 11:09
7樓作者: CON 時間: 2025-3-30 13:52
8樓作者: Lucubrate 時間: 2025-3-30 17:49
8樓作者: florid 時間: 2025-3-30 23:42
8樓作者: ferment 時間: 2025-3-31 03:15
8樓作者: 變化 時間: 2025-3-31 08:53
9樓作者: Grievance 時間: 2025-3-31 12:50
9樓作者: 說不出 時間: 2025-3-31 16:43
9樓作者: 防止 時間: 2025-3-31 19:21
9樓作者: FUME 時間: 2025-3-31 22:56
10樓作者: 支柱 時間: 2025-4-1 05:28
10樓作者: Foreshadow 時間: 2025-4-1 08:07
10樓作者: 直覺沒有 時間: 2025-4-1 10:32
10樓
