Results 11 to 20 of about 391,750 (316)
Quasi-cyclic subcodes of cyclic codes [PDF]
, 2016 We completely characterize possible indices of quasi-cyclic subcodes in a cyclic code for a very broad class of cyclic codes. We present enumeration results for quasi-cyclic subcodes of a fixed index and show that the problem of enumeration is equivalent
Belfiore, Jean-Claude +2 more
core +3 more sources
Paradigms for Parameterized Enumeration [PDF]
, 2013 The aim of the paper is to examine the computational complexity and algorithmics of enumeration, the task to output all solutions of a given problem, from the point of view of parameterized complexity.
D. Marx +7 more
core +2 more sources
Robust M-Estimation Based Bayesian Cluster Enumeration for Real Elliptically Symmetric Distributions
, 2021 Robustly determining the optimal number of clusters in a data set is an essential factor in a wide range of applications. Cluster enumeration becomes challenging when the true underlying structure in the observed data is corrupted by heavy-tailed noise ...
Muma, Michael, Schroth, Christian A.
core +1 more source
Journal of Computer and System Sciences, 2012 The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision version of the homomorphism problem received a lot of attention in literature; in particular, the way the graph-theoretical structure of the variables and constraints ...
Bulatov, Andrei A. +3 more
openaire +6 more sources
Feat: Functional Enumeration of Algebraic Types [PDF]
, 2012 In mathematics, an enumeration of a set S is a bijective function from (an initial segment of) the natural numbers to S. We define "functional enumerations" as efficiently computable such bijections.
Duregard, Jonas +2 more
core +2 more sources
European Journal of Combinatorics, 2012 AbstractIn this paper, numeration systems defined by recurrent sequences are considered. We present a class of recurrences yielding numeration systems for which the words corresponding to greedy expressions for natural numbers are easily described. Those sequences, in turn, enumerate classes of words with forbidden substrings.
MEROLA, FRANCESCA, DANIELE A. GEWURZ
openaire +3 more sources
A simple recurrence formula for the number of rooted maps on surfaces by edges and genus [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 We establish a simple recurrence formula for the number $Q_g^n$ of rooted orientable maps counted by edges and genus. The formula is a consequence of the KP equation for the generating function of bipartite maps, coupled with a Tutte equation, and it was
Sean Carrell, Guillaume Chapuy
doaj +1 more source
Discrete Mathematics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Enumeration 1-Genericity in the Local Enumeration Degrees [PDF]
Notre Dame Journal of Formal Logic, 2018 We discuss a notion of forcing that characterizes enumeration 1-genericity, and we investigate the immunity, lowness, and quasiminimality properties of enumeration 1-generic sets and their degrees. We construct an enumeration operator Δ such that, for any A, the set ΔA is enumeration 1-generic and has the same jump complexity as A.
Badillo, Liliana +2 more
openaire +3 more sources
Improving Dispersion of Bacterial Endospores for Enumeration
KONA Powder and Particle Journal, 2015 Precise enumeration of spores is crucial for accurate evaluation of spore survival in the presence of inactivating agents or extreme environmental conditions. Bacterial endospores tend to agglomerate, leading to low estimates of spore numbers.
Vijay B. Krishna +4 more
doaj +1 more source