scientific article; zbMATH DE number 1834639

zbMATH Open0999.68514MaRDI QIDQ4779134

Martin Hofmann

Publication date: 25 November 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2136/21360058

Title of this publication is not available (Why is that?)

zbMATH Keywords

computational complexitysemanticshigher-order functionsfinite model

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Model theory of finite structures (03C13) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)

Related Items (1)

The strength of non-size increasing computation

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4779134)