A lower bound for monotone arithmetic circuits computing \(0-1\) permanent (Q1276316): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Some Exact Complexity Results for Straight-Line Computations over Semirings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lower bounds on monotone complexity of the logical permanent / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On uniform circuit complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the depth complexity of formulas / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: PP is as Hard as the Polynomial-Time Hierarchy / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of computing the permanent / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Circuit Definitions of Nondeterministic Complexity Classes / rank | |||
Normal rank |
Latest revision as of 17:12, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A lower bound for monotone arithmetic circuits computing \(0-1\) permanent |
scientific article |
Statements
A lower bound for monotone arithmetic circuits computing \(0-1\) permanent (English)
0 references
2 February 1999
0 references
algebraic circuits
0 references
permanent of matrices
0 references