On the power of built-in relations in certain classes of program schemes

DOI10.1016/S0020-0190(98)00196-3zbMath0925.68070OpenAlexW2060714204MaRDI QIDQ1277684

S. R. Chauhan, Iain A. Stewart

Publication date: 2 March 1999

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(98)00196-3

zbMATH Keywords

Computational complexityFinite model theoryDescriptive complexityProgram schemes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Upper and lower bounds for first order expressibility
• Logical and schematic characterization of complexity classes
• On uniformity within \(NC^ 1\)
• On static logics, dynamic logics, and complexity classes
• Languages that Capture Complexity Classes
• Nondeterministic Space is Closed under Complementation
• On Moschovakis closure ordinals

This page was built for publication: On the power of built-in relations in certain classes of program schemes