2661 search results - page 176 / 533 » Quantum Complexity Classes |
141
Voted
COCOON
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
105
Voted
COCO
1998
Springer
15 years 7 months ago
1998
Springer
We show that MAEXP, the exponential time version of the Merlin-Arthur class, does not have polynomial size circuits. This significantly improves the previous known result due to K...
123
click to vote
CSR
2010
Springer
15 years 7 months ago
2010
Springer
We study one-head machines through symbolic and topological dynamics. In particular, a subshift is associated to the subshift, and we are interested in its complexity in terms of r...
ENTCS
2007
15 years 3 months ago
2007
This paper establishes undecidability of satisfiability for multi-modal logic equipped with the hybrid binder ↓ , with respect to frame classes over which the same language wit...
114
Voted
TIT
1998
15 years 3 months ago
1998
Abstract—A class of capacity-achieving, low-complexity, highreliability, variable-rate coding schemes is developed for communication over discrete memoryless channels with noisel...