Sciweavers

5 search results - page 1 / 1
» On the Succinctness of Nondeterminism
Sort
View
ATVA
2006
Springer
121views Hardware» more  ATVA 2006»
13 years 8 months ago
On the Succinctness of Nondeterminism
Abstract. Much is known about the differences in expressiveness and succinctness between nondeterministic and deterministic automata on infinite words. Much less is known about the...
Benjamin Aminof, Orna Kupferman
FOCS
2000
IEEE
13 years 8 months ago
Succinct quantum proofs for properties of finite groups
In this paper we consider a quantum computational variant of nondeterminism based on the notion of a quantum proof, which is a quantum state that plays a role similar to a certifi...
John Watrous
COCO
2004
Springer
78views Algorithms» more  COCO 2004»
13 years 10 months ago
Language Compression and Pseudorandom Generators
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...
Harry Buhrman, Troy Lee, Dieter van Melkebeek
AIPS
2003
13 years 6 months ago
Expressive Equivalence of Formalisms for Planning with Sensing
There have been several proposals for expressing planning problems with different forms of uncertainty, including nondeterminism and partial observability. In this paper we invest...
Jussi Rintanen
CSFW
1995
IEEE
13 years 8 months ago
Composing and decomposing systems under security properties
We investigate the formal relationship between separability of processes and the types of non-interference properties they enjoy. Though intuitively appealing, separability – th...
A. W. Roscoe, L. Wulf