Implicit computational complexity
id:
implicit-computational-complexity-267-15424659
title:
Implicit computational complexity
text:
Implicit computational complexity (ICC) is a subfield of computational complexity theory that characterizes algorithms by constraints on the way in which they are constructed, without reference to a specific underlying machine model or to explicit bounds on computational resources unlike conventional complexity theory. ICC was developed in the 1990s and employs the techniques of proof theory, substructural logic, model theory and recursion theory to prove bounds on the expressive power of high-l
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Implicit_computational_complexity
date created:
date modified:
2023-12-18T08:52:37Z
main entity:
{"identifier":"Q30324433","url":"https://www.wikidata.org/entity/Q30324433"}
image:
fields total:
13
integrity:
13