15033 search results - page 18 / 3007 » Complexity Theory and Algorithms |
SODA
2010
ACM
15 years 7 months ago
2010
ACM
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
106
click to vote
FROCOS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We present an overview of results on hierarchical and modular reasoning in complex theories. We show that for a special type of extensions of a base theory, which we call...
103
click to vote
SIAMDM
2008
14 years 9 months ago
2008
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
COCO
2001
Springer
15 years 2 months ago
2001
Springer
We use hypotheses of structural complexity theory to separate various NP-completeness notions. In particular, we introduce an hypothesis from which we describe a set in NP that is...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...