Implications of forbidden structures for extremal algorithmic problems (Q1082812)
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: Implications of forbidden structures for extremal algorithmic problems |
scientific article; zbMATH DE number 3974290
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Implications of forbidden structures for extremal algorithmic problems |
scientific article; zbMATH DE number 3974290 |
Statements
Implications of forbidden structures for extremal algorithmic problems (English)
0 references
1985
0 references
We develop and analyze P-optimal approximation algorithms for various generalized satisfiability problems and determine the corresponding P- optimal thresholds. The most novel aspect of the paper is that we develop new P-optimal algorithms for restricted generalized satisfiability problems which are defined by forbidden subformulas. All our algorithms run in linear time on a RAM.
0 references
combinatorial optimization
0 references
linear time algorithms
0 references
logical relations
0 references
P- optimal approximation algorithms
0 references
generalized satisfiability problems
0 references
P- optimal thresholds
0 references
forbidden subformulas
0 references
RAM
0 references
0.8648814
0 references
0.8550278
0 references
0.8537052
0 references
0.85265785
0 references
0.85212666
0 references
0.8509121
0 references
