Sciweavers

STACS
2000
Springer
15 years 7 months ago
Hereditary History Preserving Bisimilarity Is Undecidable
Marcin Jurdzinski, Mogens Nielsen
COCOON
1995
Springer
15 years 7 months ago
Dense Packings of 3k(k+1)+1 Equal Disks in a Circle for k=1, 2, 3, 4 and 5
Boris D. Lubachevsky, Ronald L. Graham
STACS
2000
Springer
15 years 7 months ago
Simulation and Bisimulation over One-Counter Processes
Petr Jancar, Antonín Kucera, Faron Moller
STACS
2000
Springer
15 years 7 months ago
The Complexity of Poor Man's Logic
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...
Edith Hemaspaandra