Counting classes and the fine structure between \(\mathrm{NC}^1\) and \(L\) (Q764326): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.05.050 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2221820168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of matrix rank and feasible systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships among $PL$, $\#L$, and the determinant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: PP is closed under intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic \(NC^1\) computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Classes and the Fine Structure between NC 1 and L / rank
 
Normal rank
Property / cites work
 
Property / cites work: PP is closed under truth-table reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The difference and truth-table hierarchies for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unambiguity of circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Space Analogues of Valiant’s Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The PL Hierarchy Collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean circuits versus arithmetic circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativized circuit complexity / rank
 
Normal rank

Latest revision as of 00:28, 5 July 2024

scientific article
Language Label Description Also known as
English
Counting classes and the fine structure between \(\mathrm{NC}^1\) and \(L\)
scientific article

    Statements

    Counting classes and the fine structure between \(\mathrm{NC}^1\) and \(L\) (English)
    0 references
    0 references
    13 March 2012
    0 references
    0 references
    arithmetic circuits
    0 references
    complexity classes
    0 references
    \(\mathrm{NC}^1\)
    0 references
    oracle hierarchy
    0 references
    threshold classes
    0 references
    exact counting classes
    0 references
    0 references