Sciweavers

FUIN
2007
116views more  FUIN 2007»
13 years 6 months ago
Decidability Problems of a Basic Class of Object Nets
It is shown that the boundedness problem for a certain class of basic object nets and a corresponding class of multiset rewriting systems is decidable. To achieve this result Dicks...
Roxana Dietze, Manfred Kudlek, Olaf Kummer
RANDOM
2001
Springer
13 years 11 months ago
Proclaiming Dictators and Juntas or Testing Boolean Formulae
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨©  ¤¥ ¦ §¨ belongs to a certain class of Boolean functions  or whether it is far from the...
Michal Parnas, Dana Ron, Alex Samorodnitsky