Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing (Q1941704): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2012.08.001 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2068275484 / rank | |||
Normal rank |
Revision as of 23:09, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing |
scientific article |
Statements
Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing (English)
0 references
21 March 2013
0 references
computational complexity
0 references
lower bounds
0 references
permanent
0 references
arithmetic circuits
0 references
polynomial identity testing
0 references
derandomization
0 references