Sciweavers

145 search results - page 23 / 29
» Parameterized Complexity Classes under Logical Reductions
Sort
View
JUCS
2010
117views more  JUCS 2010»
13 years 6 months ago
NP-completeness and FPT Results for Rectilinear Covering Problems
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
Vladimir Estivill-Castro, Apichat Heednacram, Fran...
KR
2000
Springer
13 years 12 months ago
Reasoning with Axioms: Theory and Practice
When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to a...
Ian Horrocks, Stephan Tobies
LPNMR
1995
Springer
13 years 12 months ago
Skeptical Rational Extensions
In this paper we propose a version of default logic with the following two properties: (1) defaults with mutually inconsistent justications are never used together in constructing ...
Artur Mikitiuk, Miroslaw Truszczynski
EUROCRYPT
2003
Springer
14 years 1 months ago
On the Security of RDSA
A variant of Schnorr’s signature scheme called RDSA has been proposed by I. Biehl, J. Buchmann, S. Hamdy and A. Meyer in order to be used in finite abelian groups of unknown ord...
Pierre-Alain Fouque, Guillaume Poupard
QEST
2007
IEEE
14 years 2 months ago
GRIP: Generic Representatives in PRISM
We give an overview of GRIP, a symmetry reduction tool for the probabilistic model checker PRISM, together with experimental results for a selection of example specifications. 1 ...
Alastair F. Donaldson, Alice Miller, David Parker