Enumeration Complexity: Incremental Time, Delay and Space
Y Strozecki - arXiv preprint arXiv:2309.17042, 2023 - arxiv.org
"Manuscript title" Page 1 UNIVERSITE DE VERSAILLES SAINT-QUENTIN-EN-YVELINES
Laboratoire Données et Algorithmes pour une Ville Intelligente et Durable David – UR 7431 …
Laboratoire Données et Algorithmes pour une Ville Intelligente et Durable David – UR 7431 …
[HTML][HTML] The joy of implications, aka pure horn formulas: mainly a survey
M Wild - Theoretical Computer Science, 2017 - Elsevier
The joy of implications, aka pure Horn formulas: Mainly a survey - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …
[PDF][PDF] Coupon collecting and transversals of hypergraphs
Coupon collecting and transversals of hypergraphs Page 1 Discrete Mathematics and
Theoretical Computer Science DMTCS vol. 15:2, 2013, 259–270 Coupon collecting and …
Theoretical Computer Science DMTCS vol. 15:2, 2013, 259–270 Coupon collecting and …
Counting or producing all fixed cardinality transversals
M Wild - Algorithmica, 2014 - Springer
Counting or Producing All Fixed Cardinality Transversals | SpringerLink Skip to main content
Advertisement SpringerLink Log in Menu Find a journal Publish with us Search Cart 1.Home …
Advertisement SpringerLink Log in Menu Find a journal Publish with us Search Cart 1.Home …
Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree
M Wild - Order, 2014 - Springer
The N cardinality k ideals of any w-element poset (k≤ w fixed) can be enumerated in time O
(Nw 3). The corresponding bound for k-element subtrees of aw-element tree is O (Nw 5). An …
(Nw 3). The corresponding bound for k-element subtrees of aw-element tree is O (Nw 5). An …
Compressed representation of learning spaces
M Wild - Journal of Mathematical Psychology, 2017 - Elsevier
Learning Spaces are certain set systems that are applied in the mathematical modeling of
education. We propose a wildcard-based compression (without loss of information) of such …
education. We propose a wildcard-based compression (without loss of information) of such …
Computing the output distribution and selection probabilities of a stack filter from the DNF of its positive Boolean function
M Wild - Journal of mathematical imaging and vision, 2013 - Springer
Many nonlinear filters used in practise are stack filters. An algorithm is presented which
calculates the output distribution of an arbitrary stack filter S from the disjunctive normal form …
calculates the output distribution of an arbitrary stack filter S from the disjunctive normal form …
Compression with wildcards: From CNFs to orthogonal DNFs by imposing the clauses one-by-one
M Wild - The Computer Journal, 2022 - academic.oup.com
We present a novel technique for converting a Boolean conjunctive normal form (CNF) into
an orthogonal disjunctive normal form (DNF), aka exclusive sum of products. Our method …
an orthogonal disjunctive normal form (DNF), aka exclusive sum of products. Our method …
How to partition or count an abstract simplicial complex, given its facets
M Wild - arXiv preprint arXiv:1302.1039, 2013 - arxiv.org
Given are the facets of an abstract (finite) simplicial complex SC. We show how to partition
SC into few pieces, each one compactly encoded by the use of wildcards. Such a …
SC into few pieces, each one compactly encoded by the use of wildcards. Such a …
Computing the output distribution of a stack filter from the DNF of its positive Boolean function
M Wild - 2010 - scholar.sun.ac.za
The majority of nonlinear filters used in practise are stack filters. An algorithm is presented
which calculates the output distribution of an arbitrary stack filter S from the disjunctive …
which calculates the output distribution of an arbitrary stack filter S from the disjunctive …