A Circuit Complexity Approach to Transductions (Q2946331): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Regular languages in \(NC\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying proofs in constant depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transducers with Origin Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting with rational functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3853135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4439449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order definable string transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity, circuits, and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-depth circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: The descriptive complexity approach to LOGCFL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on<i>C</i>-varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Varieties and rational functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4302435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3044353 / rank
 
Normal rank

Latest revision as of 18:21, 10 July 2024

scientific article
Language Label Description Also known as
English
A Circuit Complexity Approach to Transductions
scientific article

    Statements

    Identifiers