Matches in DBpedia 2014 for { <http://dbpedia.org/resource/HO_(complexity)> ?p ?o. }
Showing items 1 to 14 of
14
with 100 items per page.
- HO_(complexity) abstract "High-order logic is an extension of first-order and second-order with high order quantifiers. In descriptive complexity we can see that it is equal to the ELEMENTARY functions. There is a relation between the th order and non determinist algorithm the time of which is with level of exponentials.".
- HO_(complexity) wikiPageID "27823455".
- HO_(complexity) wikiPageRevisionID "579953881".
- HO_(complexity) hasPhotoCollection HO_(complexity).
- HO_(complexity) subject Category:Computational_complexity_theory.
- HO_(complexity) subject Category:Descriptive_complexity.
- HO_(complexity) subject Category:Finite_model_theory.
- HO_(complexity) comment "High-order logic is an extension of first-order and second-order with high order quantifiers. In descriptive complexity we can see that it is equal to the ELEMENTARY functions. There is a relation between the th order and non determinist algorithm the time of which is with level of exponentials.".
- HO_(complexity) label "HO (complexity)".
- HO_(complexity) sameAs m.0cc59nl.
- HO_(complexity) sameAs Q5635535.
- HO_(complexity) sameAs Q5635535.
- HO_(complexity) wasDerivedFrom HO_(complexity)?oldid=579953881.
- HO_(complexity) isPrimaryTopicOf HO_(complexity).