CORR
2012
Springer
12 years 8 months ago
2012
Springer
Identifying and controlling bias is a key problem in empirical sciences. Causal diagram theory provides graphical criteria for deciding whether and how causal effects can be iden...
ORL
2010
13 years 7 months ago
2010
We show a robot vacuum using a protocol that next cleans the "dirtiest" incident edge may take exponential time to clean a network. This disproves a conjecture of Messing...
NC
2011
13 years 7 months ago
2011
We consider recognizer P systems having three polarizations associated to the membranes, and we show that they are able to solve the PSPACEcomplete problem Quantified 3SAT when wo...
AIML
2004
14 years 1 months ago
2004
This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponent...
AAAI
2008
14 years 2 months ago
2008
Answering conjunctive queries (CQs) has been recognized as a key task for the usage of Description Logics (DLs) in a number of applications, and has thus been studied by many auth...
FOCS
1995
IEEE
14 years 4 months ago
1995
IEEE
We prove that if strong pseudorandom number generators exist, then the class of languages that have polynomialsized circuits (P/poly) is not measurable within exponential time, in...
WEBDB
2005
Springer
14 years 6 months ago
2005
Springer
Nonrecursive XQuery is known to be hard for nondeterministic exponential time. Thus it is commonly believed that any algorithm for evaluating XQuery has to require exponential amo...