Nondeterministic \(NC^1\) computation (Q1276170): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4266552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Uniform Circuit Lower Bound for the Permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: A very hard log-space counting class / 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: On uniformity within \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite monoids and the fine structure of <i>NC</i> <sup>1</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions to Barrington's M-program model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Algebraic Formulas Using a Constant Number of Registers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Relating Time and Space to Size and Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A uniform approach to define complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing counting classes for logspace, one-way logspace, and first-order / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Parallel Algorithm for Formula Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bits and relative order from residues, space efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gap-definable counting classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On balanced versus unbalanced computation trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logspace and logtime leaf languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On counting and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unambiguity of circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On iterated integer product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word Problems Solvable in Logspace / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(NC^ 1\): The automata-theoretic viewpoint / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursion theoretic characterizations of complexity classes of counting functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some observations on the connection between counting and recursion / rank
 
Normal rank

Latest revision as of 18:07, 28 May 2024

scientific article
Language Label Description Also known as
English
Nondeterministic \(NC^1\) computation
scientific article

    Statements

    Nondeterministic \(NC^1\) computation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1998
    0 references
    0 references
    counting classes
    0 references
    0 references
    0 references
    0 references
    0 references