scientific article; zbMATH DE number 1978903

zbMATH Open1034.68045MaRDI QIDQ4425337FDOQ4425337

Authors: Argimiro Arratia 

Publication date: 2002

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

Recommendations

• Descriptive characterizations of computational complexity
• scientific article; zbMATH DE number 1254648
• scientific article; zbMATH DE number 1072527
• Computational complexity and the expressive power of logics
• scientific article; zbMATH DE number 4106276

zbMATH Keywords

finite model theory

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)

Cited In (7)

• Uniform normal form for general time-bounded complexity classes
• A descriptive complexity approach to the linear hierarchy.
• Descriptive characterizations of computational complexity
• Capturing complexity classes with Lindström quantifiers
• Title not available (Why is that?)
• Computational complexity and the expressive power of logics
• Title not available (Why is that?)

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 Q4425337)