Complexity, decidability and completeness (Q5480615): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Feasible Graphs and Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively presented games and strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time Abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time versus recursive models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Multiple-Precision Evaluation of Elementary Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Class groups of integral group rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every recursive linear ordering has a copy in DTIME-SPACE(<i>n</i>,log(<i>n</i>)) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity-theoretic algebra. II: Boolean algebras / rank
 
Normal rank

Latest revision as of 18:25, 24 June 2024

scientific article; zbMATH DE number 5043298
Language Label Description Also known as
English
Complexity, decidability and completeness
scientific article; zbMATH DE number 5043298

    Statements