scientific article; zbMATH DE number 7561759
From MaRDI portal
Publication:5092482
DOI10.4230/LIPIcs.CCC.2020.31MaRDI QIDQ5092482
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
self-reducibilityminimum circuit size problemgate eliminationminimum formula size problemsearch to decision reduction
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
- The complexity of Boolean formula minimization
- The new complexity landscape around circuit minimization
- Generating random binary trees -- a survey
- Discrete logarithm and minimum circuit size
- Zero knowledge and circuit minimization
- Circuit minimization problem
- Information theory and the complexity of boolean functions
- A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms
- Learning algorithms from natural proofs
- Power from Random Strings
- Natural proofs
This page was built for publication:
