Inductive Complexity of P versus NP Problem (Q4648186): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1007/978-3-642-32894-7_2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W166247508 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57001497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-Recursive Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5188206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3584055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the four colour theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5439769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of Euler's integer partition theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of proving chaoticity and the Church–Turing thesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4806962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5389345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3589189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Program-Size Complexity Measure for Mathematical Problems and Conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Partitions with Applications to the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2015 Mathematics Programs That Make a Difference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3090774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms / rank
 
Normal rank

Latest revision as of 21:08, 5 July 2024

scientific article; zbMATH DE number 6103558
Language Label Description Also known as
English
Inductive Complexity of P versus NP Problem
scientific article; zbMATH DE number 6103558

    Statements

    Inductive Complexity of P versus NP Problem (English)
    0 references
    0 references
    0 references
    0 references
    8 November 2012
    0 references
    0 references
    0 references
    0 references