Pages that link to "Item:Q1813126"
From MaRDI portal
The following pages link to The gap between monotone and non-monotone circuit complexity is exponential (Q1813126):
Displayed 15 items.
- On derandomization and average-case complexity of monotone functions (Q428873) (← links)
- Negation-limited circuit complexity of symmetric functions (Q671626) (← links)
- A note on the power of majority gates and modular gates (Q673905) (← links)
- A lower bound for intuitionistic logic (Q876385) (← links)
- One-way permutations, computational asymmetry and distortion. (Q959774) (← links)
- On the minimum number of negations leading to super-polynomial savings (Q1029051) (← links)
- Non-cancellative Boolean circuits: A generalization of monotone boolean circuits (Q1566723) (← links)
- An exponential gap with the removal of one negation gate (Q1603543) (← links)
- On the negation-limited circuit complexity of merging (Q1861565) (← links)
- Monotone simulations of non-monotone proofs. (Q1872729) (← links)
- Valiant's holant theorem and matchgate tensors (Q2382280) (← links)
- Applications of matrix methods to the theory of lower bounds in computational complexity (Q2638784) (← links)
- On Linear Secret Sharing for Connectivity in Directed Graphs (Q3540044) (← links)
- On Negations in Boolean Networks (Q3644711) (← links)
- Natural proofs (Q5906823) (← links)