scientific article; zbMATH DE number 1796951

zbMATH Open0991.68030MaRDI QIDQ4551343

Iain Stewart

Publication date: 5 September 2002

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

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

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)

Related Items (1)

Program schemes, arrays, Lindström quantifiers and zero-one laws

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The computability of relaxed data structures: queues and stacks as examples 👍 👎
• 0-1 laws for recursive structures 👍 👎
• Program schemes, arrays, Lindström quantifiers and zero-one laws 👍 👎
• Analysing Multiprogramming Queues by Generating Functions 👍 👎
• The Computability of Relaxed Data Structures: Queues and Stacks as Examples 👍 👎
• Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws 👍 👎
• Recursive Solutions for the Generalized Erlang Queueing Systems 👍 👎

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