Languages represented by Boolean formulas (Q290253): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03B05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q19 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94C10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6588310 / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
descriptive complexity theory
Property / zbMATH Keywords: descriptive complexity theory / rank
 
Normal rank
Property / zbMATH Keywords
 
succinct problems
Property / zbMATH Keywords: succinct problems / rank
 
Normal rank
Property / zbMATH Keywords
 
propositional logic
Property / zbMATH Keywords: propositional logic / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Datalog / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct circuit representations and leaf language classes are basically the same concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second order logic and the weak exponential hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages that Capture Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of graph problems with succinct multigraph representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on succinct representations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods for proving completeness via logical reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representation, leaf languages, and projection reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of combinatorial problems with succinct input representation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:57, 12 July 2024

scientific article
Language Label Description Also known as
English
Languages represented by Boolean formulas
scientific article

    Statements

    Languages represented by Boolean formulas (English)
    0 references
    0 references
    1 June 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    descriptive complexity theory
    0 references
    succinct problems
    0 references
    propositional logic
    0 references