On the complexity of slice functions
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3889430
- More on the complexity of slice functions
- The complexity of central slice functions
- Graph complexity and slice functions
- scientific article; zbMATH DE number 2006645
- The slice map problem and approximation properties
- On the computational complexity of cut-reduction
- Techniques and applications of computation slicing
- scientific article; zbMATH DE number 3979140
- scientific article; zbMATH DE number 1574595
Cites work
- scientific article; zbMATH DE number 3566175 (Why is no real title available?)
- scientific article; zbMATH DE number 3387244 (Why is no real title available?)
- An n3/2 lower bound on the monotone network complexity of the Boolean convolution
- Boolean functions whose monotone complexity is of size \(n^ 2\) / log n
- Monotone switching circuits and Boolean matrix product
- Negation is Powerless for Boolean Slice Functions
- Sorting in \(c \log n\) parallel steps
- The complexity of monotone boolean functions
Cited in
(10)- scientific article; zbMATH DE number 3889430 (Why is no real title available?)
- The slice map problem and approximation properties
- Negation is Powerless for Boolean Slice Functions
- More on the complexity of slice functions
- The complexity of central slice functions
- On monotone simulations on nonmonotone networks
- \(\text{PI}_ k\) mass production and an optimal circuit for the Nečiporuk slice
- The conjunctive complexity of quadratic Boolean functions
- On the mystery of negations in circuits: structure vs power
- Graph complexity and slice functions
This page was built for publication: On the complexity of slice functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1066866)
