Algorithmic combinatorics based on slicing posets

DOI10.1007/3-540-36206-1_16MaRDI QIDQ4415253zbMATH OpenFDO

Authors Vijay K. Garg

Publication date 28 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2556/25560169.htm

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Distributed algorithms (68W15)

Recommendations

• Algorithmic combinatorics based on slicing posets
• The art of computer programming. Vol. 4, Fasc. 0--4. Fasc. 0: Introduction to combinatorial algorithms and Boolean functions. Fasc. 1: Bitwise tricks \& techniques, binary decision diagrams. Fasc. 2: Generating all tuples and permutations. Fasc. 3: Genera
• Computation slicing: Techniques and theory
• Techniques and applications of computation slicing
• Some algorithmic applications of partition functions in combinatorics

Cited in

(3)

• Intractability results in predicate detection
• Techniques and applications of computation slicing
• Algorithmic combinatorics based on slicing posets

This page was built for publication: Algorithmic combinatorics based on slicing posets

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