Approximate formulae for a logic that capture classes of computational complexity (Q3613175)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximate formulae for a logic that capture classes of computational complexity |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate formulae for a logic that capture classes of computational complexity |
scientific article |
Statements
Approximate formulae for a logic that capture classes of computational complexity (English)
0 references
11 March 2009
0 references
proportional quantifiers
0 references
approximate formulae
0 references
almost order
0 references
expressiveness
0 references
computational complexity
0 references
P
0 references
NL
0 references
