scientific article; zbMATH DE number 4068271
From MaRDI portal
Publication:3801065
zbMATH Open0654.68041MaRDI QIDQ3801065FDOQ3801065
Authors: Stasys Jukna 
Publication date: 1987
Title of this publication is not available (Why is that?)
Recommendations
- Stochastic Algorithms: Foundations and Applications
- On Nečiporuk's theorem for branching programs
- scientific article; zbMATH DE number 3987204
- On algorithm complexity
- A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials
- Complexity Based on Partitioning of Boolean Circuits and their Relation to Multivalued Circuits
- scientific article; zbMATH DE number 51644
- scientific article; zbMATH DE number 66469
- scientific article; zbMATH DE number 4087011
- Nondeterminism and an abstract formulation of Nečiporuk's lower bound method
Cited In (6)
- Counting and Computing Join-Endomorphisms in Lattices
- Counting complements in the partition lattice, and hypertrees
- On-line computations of the ideal lattice of posets
- On the shortest sequences of elementary transformations in the partition lattice
- Characterizations of partition lattices
- Representing partition lattices through FCA
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 Q3801065)
