scientific article

zbMATH Open0767.68044MaRDI QIDQ4028122

Iain Stewart

Publication date: 28 March 1993

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

zbMATH Keywords

first-order language FONP-complete graph operatorsrepresentation of complexity classes via languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Non-perturbative graph languages, halting problem and complexity

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