scientific article; zbMATH DE number 1770478

MaRDI QIDQ4540541zbMATH OpenFDO

Authors Kenneth H. Rosen

Publication date 23 July 2002

zbMATH Keywords

automationBoolean algebracomplexity of algorithmscountinglogicshortest pathtextbook

Mathematics Subject Classification ID

Mathematics in general (00A05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)

Cited in

(12)

• Explicit enumeration of 321, hexagon-avoiding permutations
• New binary associative memory model based on the XOR operation
• P₂ H-super antimagic total labeling of comb product of graphs
• Strategy optimization for deductive games
• scientific article; zbMATH DE number 41070 (Why is no real title available?)
• scientific article; zbMATH DE number 486483 (Why is no real title available?)
• scientific article; zbMATH DE number 1868631 (Why is no real title available?)
• On the regularity of sets of multi-accepted strings of a non-deterministic finite automaton
• Optimal chaos control and discretization algorithms
• A method for uniformly proving a family of identities
• The continuous-time magnetic quantum walk and its probability invariance on a class of graphs
• An improved combinatorial approach for pricing Parisian options

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 Q4540541)