scientific article; zbMATH DE number 5077418
From MaRDI portal
Publication:3412385
Recommendations
- On complexity of schemes in degenerate bases
- On complexity of schemes in incomplete bases
- scientific article; zbMATH DE number 3187207
- scientific article; zbMATH DE number 3937108
- scientific article; zbMATH DE number 4047105
- On the complexity of schemes in an infinite basis
- A method for obtaining more than quadratic effective lower estimates of complexity of schemes
- On complexity of linear operators on the class of circuits of depth 2
- On the complexity of computing Gröbner bases in characteristic 2
- The conditional distribution of the output of an automaton without memory for given characteristics of the input
Cited in
(10)- Representing \((0,1)\)-matrices by Boolean circuits
- Periodic Boolean functions and a lower bound for the complexity of operators
- Depth of schemes embedded in a unit cube and implementing typical Boolean functions
- The complexity of depth-two information networks
- On the informational component in the complexity of a shift operator
- Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates
- scientific article; zbMATH DE number 3937108 (Why is no real title available?)
- scientific article; zbMATH DE number 4097288 (Why is no real title available?)
- Min-rank conjecture for log-depth circuits
- Entropy of operators or why matrix multiplication is hard for depth-two circuits
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 Q3412385)
