On NC-real complexity classes for additive circuits and their relations with NC (Q5096867): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On digital nondeterminism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing over the reals with addition and order: Higher complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a \(P \neq NP\) result for a restricted class of real machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4729767 / rank
 
Normal rank

Latest revision as of 21:45, 29 July 2024

scientific article; zbMATH DE number 7573172
Language Label Description Also known as
English
On NC-real complexity classes for additive circuits and their relations with NC
scientific article; zbMATH DE number 7573172

    Statements

    Identifiers