\(\mathbf P =\mathbf{NP}\) for some structures over the binary words (Q2387422): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Armin Hemmerling / rank
Normal rank
 
Property / author
 
Property / author: Armin Hemmerling / rank
 
Normal rank
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.jco.2005.02.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997799060 / 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: Q4942157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic properties of structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The P-DNP problem for infinite Abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accessible telephone directories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of String Functions Over Algebraic Structures Armin Hemmerling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On P Versus NP for Parameter-Free Programs Over Algebraic Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>P</i> versus <i>NP</i> and computability theoretic constructions in complexity theory over algebraic structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on real structural complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A model-theoretic proof for <i>P ≠ NP</i> over all infinite abelian group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4328056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank

Latest revision as of 14:59, 10 June 2024

scientific article
Language Label Description Also known as
English
\(\mathbf P =\mathbf{NP}\) for some structures over the binary words
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references