1007 search results - page 21 / 202 » The Complexity of Futile Questioning |
COCOON
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
CADE
1992
Springer
14 years 1 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
COCOON
2009
Springer
13 years 10 months ago
2009
Springer
We investigate the question whether NE can be separated from the reduction closures of tally sets, sparse sets and NP. We show that (1) NE RNP no(1)-T (TALLY); (2)NE RSN m (SPARS...
BSL
2008
13 years 9 months ago
2008
The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is 1 1-complete. This result an...
HCI
2009
13 years 7 months ago
2009
Abstract. Interactive Game-Based Learning might be used to raise the awareness of students concerning questions of sustainability. Sustainability is a very complex topic. By intera...