Complexity of the satisfiability problem for a class of propositional schemata (Q3564849)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5712455
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of the satisfiability problem for a class of propositional schemata |
scientific article; zbMATH DE number 5712455 |
Statements
Complexity of the Satisfiability Problem for a Class of Propositional Schemata (English)
0 references
26 May 2010
0 references
0.8780299425125122
0 references
0.8732558488845825
0 references
0.8617040514945984
0 references
0.8607521057128906
0 references
0.8592725396156311
0 references
