scientific article; zbMATH DE number 3867330

zbMATH Open0545.05001MaRDI QIDQ3335786FDOQ3335786

Authors: Kenneth P. Bogart 

Publication date: 1983

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 2001449
• Introduction to combinatorics
• Einführung in die Kombinatorik
• Introduction to combinatorics
• Introduction to combinatorics
• Introduction to combinatorics
• scientific article; zbMATH DE number 6159278

zbMATH Keywords

greedy algorithmgenerating functionsmatchingsenumeration problemsblockdesigns

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx) Enumerative combinatorics (05Axx) Designs and configurations (05Bxx)

Cited In (26)

• Title not available (Why is that?)
• Title not available (Why is that?)
• T-structures, T-functions, and texts
• Five discordant permutations
• Low density series expansions for backbone properties of percolation clusters
• On greatest common divisor matrices and their applications
• Fractional weak discrepancy and interval orders
• On \(k\)-weak orders: Recognition and a tolerance result
• A new family of proximity graphs: class cover catch digraphs
• Kvant selecta: Combinatorics. I. Collection of articles translated by Hal McFaden from Russian editions of the journal Kvant
• On the relation between conditional independence models determined by finite distributive lattices and by directed acyclic graphs
• Fast linear-space computations of longest common subsequences
• The power of logical clock abstractions
• An expanded table of probability values for rao's spacing test
• Stochastic monotonicity and realizable monotonicity
• The fractional weak discrepancy of a partially ordered set
• Title not available (Why is that?)
• Consistent global checkpoints based on direct dependency tracking
• Robust hypothesis tests for independence in community assembly
• A fast and practical bit-vector algorithm for the longest common subsequence problem
• Realization and synthesis of reversible functions
• The proportion of fixed-point-free elements of a transitive permutation group
• B(m,n)=G(m)G(n)/G(m + n)and volume of ann‐dimensional sphere
• Group rings with n-generated ideals
• The combinatorics of discrete self-similarity
• On the (in)security of optimized Stern-like signature schemes

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3335786)