Sciweavers

922 search results - page 5 / 185
» A generalization of the Lin-Zhao theorem
Sort
View
DLT
2009
13 years 5 months ago
On the Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations
Abstract. We analyze Hmelevskii's theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formu...
Aleksi Saarela
CADE
2001
Springer
14 years 8 months ago
A New Meta-complexity Theorem for Bottom-Up Logic Programs
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...
Harald Ganzinger, David A. McAllester
JSYML
2010
60views more  JSYML 2010»
13 years 2 months ago
Generalizations of small profinite structures
We generalize the model theory of small profinite structures developed by Newelski to the case of compact metric spaces considered together with compact groups of homeomorphisms a...
Krzysztof Krupinski
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 5 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker
DM
2006
80views more  DM 2006»
13 years 7 months ago
A class of combinatorial identities
A general theorem for providing a class of combinatorial identities where the sum is over all the partitions of a positive integer is proven. Five examples as the applications of ...
Yingpu Deng