Sciweavers

1449 search results - page 114 / 290
» Finiteness results for sigmoidal
Sort
View
ICALP
1992
Springer
15 years 10 months ago
Barbed Bisimulation
This paper defines a probabilistic barbed congruence which turns out to coincide with observational equivalence in a probabilistic extension of CCS. Based on this coincidence resu...
Robin Milner, Davide Sangiorgi
LATIN
2010
Springer
15 years 8 months ago
Complexity of Operations on Cofinite Languages
We study the worst case complexity of regular operations on cofinite languages (i.e., languages whose complement is finite) and provide algorithms to compute efficiently the result...
Frédérique Bassino, Laura Giambruno,...
AML
2010
98views more  AML 2010»
15 years 6 months ago
Small universal families for graphs omitting cliques without GCH
When no single universal model for a set of structures exists at a given cardinal, then one may ask in which models of set theory does there exist a small family which embeds the r...
Katherine Thompson
BSL
2008
97views more  BSL 2008»
15 years 6 months ago
The Complexity of Orbits of Computably Enumerable Sets
The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is 1 1-complete. This result an...
Peter Cholak, Rodney G. Downey, Leo Harrington
ECCC
2010
111views more  ECCC 2010»
15 years 6 months ago
Pseudorandom Generators for Group Products
We prove that the pseudorandom generator introduced in [INW94] fools group products of a given finite group. The seed length is O(log n log 1 ), where n the length of the word and...
Michal Koucký, Prajakta Nimbhorkar, Pavel P...