P\(\neq\) NC over the \(p\)-adic numbers (Q1869961): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4398782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPLEXITY AND REAL COMPUTATION: A MANIFESTO / rank
 
Normal rank
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: Q5571530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4044675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On definable subsets of <i>p</i>-adic fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity over the \(p\)-adic numbers / rank
 
Normal rank

Latest revision as of 15:41, 5 June 2024

scientific article
Language Label Description Also known as
English
P\(\neq\) NC over the \(p\)-adic numbers
scientific article

    Statements