165 search results - page 2 / 33 » Exotic Quantifiers, Complexity Classes, and Complete Problem... |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We develop a method for measuring homology classes. This involves three problems. First, we define the size of a homology class, using ideas from relative homology. Second, we defi...
LICS
1999
IEEE
13 years 10 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
BIRTHDAY
2004
Springer
13 years 9 months ago
2004
Springer
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...
ATAL
2011
Springer
12 years 5 months ago
2011
Springer
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
COMPLEXITY
2010
13 years 3 months ago
2010
In this paper we introduce the Partition Task problem class along with a complexity measure to evaluate its instances and a performance measure to quantify the ability of a system...