Succinct circuit representations and leaf language classes are basically the same concept

DOI10.1016/0020-0190(96)00096-8zbMATH Open0875.68429OpenAlexW2016550752MaRDI QIDQ671606FDOQ671606

Authors: Bernd Borchert, Antoni Lozano 

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00096-8

Recommendations

• Succinct representation, leaf languages, and projection reductions
• Machines, Computations, and Universality
• A characterization of the leaf language classes
• Mathematical Foundations of Computer Science 2005

zbMATH Keywords

Computational complexityLeaf language classesPolynomial-time many-one completenessSuccinct representations

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Title not available (Why is that?)
• A uniform approach to define complexity classes
• Logspace and logtime leaf languages
• Complexity classes and sparse oracles
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Succinct representation, leaf languages, and projection reductions
• Succinct representations of graphs
• Computational Work and Time on Finite Machines

Cited In (9)

• On the complexity of data disjunctions.
• Equality Testing of Compressed Strings
• Model-checking hierarchical structures
• Leaf languages and string compression
• Languages represented by Boolean formulas
• Succinctness as a source of complexity in logical formalisms
• Succinct representation, leaf languages, and projection reductions
• Lindström quantifiers and leaf language definability
• UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS

This page was built for publication: Succinct circuit representations and leaf language classes are basically the same concept

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