9842 search results - page 232 / 1969 » Problem complexity |
145
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
179
click to vote
DAM
2008
15 years 6 months ago
2008
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
173
click to vote
ECCC
2008
15 years 6 months ago
2008
Higman essentially showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. Let s1, s2, s3, . . . be the sta...
169
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
178
click to vote
JC
2008
15 years 6 months ago
2008
In this paper we analyze the problem of adaptivity for one-step numerical methods for solving ODEs, both IVPs and BVPs, with a view to generating grids of minimal computational co...