Showing papers in "Electronic Notes in Discrete Mathematics in 2001"

TL;DR: An apparatus is described for use in asbestos removal from an enclosed space where air is drawn into the collector pan and delivered to the trap with the asbestos fibers being at least partially trapped by water within the cylindrical trap.

TL;DR: The results indicate that, provided sufficient training on a given class, the resulting strategy performs as well as (and, in some cases, better than) the best branching rule for that class.

TL;DR: A 7-variable, 2-resilient Boolean function is constructed which solves the maximum nonlinearity issue for 7- variable functions with any order of resiliency and constructions of some unbalanced correlation immune functions of 5 and 6 variables which attain the upper bound on non linearity are concluded.

TL;DR: In this article, it was shown that if N = 2 k ≥ 16, then there exist exactly ⌊( k − 1)/2⌋ pairwise nonequivalent Z 4 -linear Hadamard (N, 2 N, N /2)-codes and ⌈( k + 1)/ 2⌉ pairwise zero-rank extended perfect (N, 2 N/2 N, 4)-codes.

TL;DR: PaSAT is a parallel implementation of a Davis-Putnam-style prepositional satisfiability checker incorporating dynamic search space partitioning, intelligent backjumping, as well as lemma generation and exchange, with the main focus on speeding up SAT-checking of prepositions of real-world combinatorial problems.

TL;DR: In this article, the problem of testing for existence of an n-node graph G satisfying some condition P, expressed as a Boolean constraint among the nxn Boolean entries of the adjacency matrix M, is reduced to satisfiability of P(M).

TL;DR: It is claimed that all the power of this heuristic is not used in SATZ, and that UPL can be extended to solve some real world structured problems, where the major competitors are using intelligent backtracking or specific deduction rules.

TL;DR: Auto-Walksat is introduced, a general algorithm which automatically tunes any variant of the Walksat family of stochastic satisfiability solvers and its success in tuning Walksatsat-SKC to the DIMACS benchmark problems with negligible additional overhead is demonstrated.

TL;DR: The parallelization of Satz is presented using work stealing for workload balancing, based on the master/slave communication model, which easily supports fault tolerance computing and accumulation of intermediate results over time.

TL;DR: It is proved that the maximum inferred local consensus tree problem is NP-complete, thus resolving an open question from (form?)

TL;DR: A simple algorithm based on a Markov chain for generating acyclic digraphs with a given number of vertices uniformly at random is proposed, which was able to estimate the density function of classical statistics on acYclicDigraphs.

TL;DR: An heuristic procedure is developed which is able, for unsatisfiable instances, to locate a set of clauses causing unsatisfiability that corresponds to the part of the system that the authors respectively need to re-design or to keep when they respectively want a satisfiable or unsatisfiable formula.

TL;DR: These dual heuristics for the directed cut formulation of the Steiner problem in graphs have a good practical performance and solved several open instances, including the 1320 series and very large and degenerated problems from VLSI layout.

TL;DR: All cyclic codes over Z 4 of length 2 n , n odd are classified in terms of discrete Fourier transforms, generator polynomials, parity check matrices, and the concatenated ( a + b ∣ b ) construction.

TL;DR: Being dynamically generated and constantly updated and improved, this site can be considered as an almost always up-to-date SAT experimentation paper.

TL;DR: This approach provides a fully stochastic, but complete, search algorithm for SAT, and relates randomized backtracking with a more general form of backtracking, referred to as unrestricted backtracking.

TL;DR: It is proved that for any t <= q−1 there exist sequences of such codes with asymptotically nonvanishing rate.

TL;DR: The theoretical results described here will be used to design an efficient Branch&Cut algorithm in a future work, and some families of facets of the associated polytope are determined.

TL;DR: This paper determines completely the structure of linear codes over Z/NZ of constant weight, and presents a general uniqueness theorem for virtual linear codes of constantWeight.

TL;DR: This note presents a formulation of two related combinatorial embedding problems concerning level graphs in terms of CNF-formulas, known as level planar embedding and crossing-minimization-problem.

TL;DR: It is shown that GOST is secure against the linear cryptanalysis after five rounds and against the differential crypt analysis after seven rounds.

TL;DR: A new PKC is presented based on the idea of a right scrambler — a special non-singular matrix by which the public key is multiplied to the right, which makes system more resistant to structural attacks at the little extra cost of a few additional columns.

TL;DR: A unified theory of Grobner bases over a principal ideal ring with a view to applications in Coding Theory, for example to the structure of codes over a finite-chain ring, e.g. a Galois ring is presented.

TL;DR: It is shown how the distance labelling scheme for trees presented in [?] can be extended to distance hereditary graphs with optimal length labels, based on the split decomposition of a graph.

TL;DR: In this paper, Zhang and Zheng (1995) used the measure Δ f, the highest magnitude of all autocorrelation coefficients for a function f, to construct balanced functions with currently best known nonlinearity and Δ f values together.

TL;DR: It is shown that GDJ CS have PAPR ≤ 2.0 under all unitary transforms whose rows are unimodular linear (Linear Unimodular Unitary Transforms (LUUTs)), including one- and multi-dimensional generalised DFTs.

TL;DR: It is shown that the new generator based on Latin squares is one member of a family of related models that generate distributions ranging from ones that are everywhere tractable to ones that exhibit a sharp hardness threshold.

TL;DR: Several autarky systems for generalized clause-sets are discussed, the relation to polynomial time computability is discussed, and the relation of monoids and autarkies to ordered sets is discussed.