Extensional Uniformity for Boolean Circuits
From MaRDI portal
Publication:3540171
Recommendations
Cites work
- scientific article; zbMATH DE number 6003856 (Why is no real title available?)
- scientific article; zbMATH DE number 3426894 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 618821 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- An infinite hierarchy of intersections of context-free languages
- Arithmetic, first-order logic, and counting quantifiers
- Expressibility and Parallel Complexity
- First-order expressibility of languages with neutral letters or: The Crane Beach conjecture
- On Relating Time and Space to Size and Depth
- On uniform circuit complexity
- On uniformity within \(NC^ 1\)
- P-uniform circuit complexity
- Rudimentary Predicates and Relative Computation
- Some subclasses of context-free languages in \(NC^ 1\)
- Studies in abstract families of languages
- The descriptive complexity approach to LOGCFL
- Turing machines that take advice
- Visibly pushdown languages
This page was built for publication: Extensional Uniformity for Boolean Circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540171)