Pages that link to "Item:Q2013543"

The following pages link to On the complexity of the permanent in various computational models (Q2013543):

Displaying 4 items.

• Geometric complexity theory and matrix powering (Q1679673) (← links)
• Permanent v. determinant: an exponential lower bound assuming symmetry and a potential path towards Valiant's conjecture (Q1679675) (← links)
• A lower bound on determinantal complexity (Q2087768) (← links)
• The Hafnian master theorem (Q2158281) (← links)