Upper and lower bounds on the complexity of generalised resolution and generalised constraint satisfaction problems (Q1430293)
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: Upper and lower bounds on the complexity of generalised resolution and generalised constraint satisfaction problems |
scientific article; zbMATH DE number 2069242
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper and lower bounds on the complexity of generalised resolution and generalised constraint satisfaction problems |
scientific article; zbMATH DE number 2069242 |
Statements
Upper and lower bounds on the complexity of generalised resolution and generalised constraint satisfaction problems (English)
0 references
27 May 2004
0 references
satisfiability problem
0 references
systems with partial instantiation
0 references
propositional logic
0 references
constraint satisfaction problems
0 references
polynomial time hierarchies
0 references
generalised resolution
0 references
lower bounds for resolution
0 references
upper bounds for SAT algorithms
0 references
automatisation of proof systems
0 references
generalised input resolution
0 references
generalised width restricted resolution
0 references
induced width of constraint satisfaction problems
0 references
0.7691116333007812
0 references
0.7489205002784729
0 references
0.7464783191680908
0 references
0.7453056573867798
0 references
0.7436090707778931
0 references
