6 search results - page 1 / 2 » A Linguistic Characterization of Bounded Oracle Computation ... |
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
LATA
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the ling...
STOC
1993
ACM
13 years 8 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. The synthesis of a reactive system with respect to an ωregular specification requires the solution of a graph game. Such games have been extended in two natural ways. F...
CORR
2009
Springer
13 years 2 months ago
2009
Springer
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...