13306 search results - page 315 / 2662 » Theoretical Computer Science |
169
click to vote
SPIN
2007
Springer
16 years 24 days ago
2007
Springer
We propose an algorithm to compute a counterexample of minimal size to some property in a finite state program, using the same space constraints than SPIN. This algorithm uses nes...
145
click to vote
STACS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We consider a collection of robots which are identical (anonymous), have limited visibility of the environment, and no memory of the past (oblivious); furthermore, they a...
170
click to vote
FOCS
1997
IEEE
15 years 11 months ago
1997
IEEE
We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded computation can be made unambiguous. An analogous result holds for the class of pr...
153
click to vote
FOCS
1992
IEEE
15 years 10 months ago
1992
IEEE
Abstract Summary of results The subcubic (O(n ) for < 3) algorithms to multiply Boolean matrices do not provide the witnesses; namely, they compute C = AB but if Cij = 1 they d...
160
click to vote
MFCS
1990
Springer
15 years 10 months ago
1990
Springer
The plausibility of computing the answers to many membership queries to a hard set with few queries is the subject of the theory of terseness. In this paper, we develop companion ...