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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import240304020342 (talk | contribs)
Set profile property.
(3 intermediate revisions by 3 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
links / mardi / namelinks / mardi / name
 

Revision as of 00:56, 5 March 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
    computational complexity
    0 references
    descriptive complexity theory
    0 references
    succinct problems
    0 references
    propositional logic
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references