Sciweavers

1199 search results - page 176 / 240
» Parameterized Proof Complexity
Sort
View
FSTTCS
2008
Springer
13 years 10 months ago
Average-Time Games
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by ...
Marcin Jurdzinski, Ashutosh Trivedi
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 9 months ago
Logics for the Relational Syllogistic
The Aristotelian syllogistic cannot account for the validity of certain inferences involving relational facts. In this paper, we investigate the prospects for providing a relationa...
Ian Pratt-Hartmann, Lawrence S. Moss
ENTCS
2008
85views more  ENTCS 2008»
13 years 9 months ago
Connectivity Properties of Dimension Level Sets
This paper initiates the study of sets in Euclidean space Rn (n 2) that are defined in terms of the dimensions of their elements. Specifically, given an interval I [0, 1], we ar...
Jack H. Lutz, Klaus Weihrauch
DAM
2006
88views more  DAM 2006»
13 years 8 months ago
NP-completeness results for edge modification problems
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
Pablo Burzyn, Flavia Bonomo, Guillermo Durá...
ISCI
2008
160views more  ISCI 2008»
13 years 8 months ago
Certificateless undeniable signature scheme
In this paper, we present the first certificateless undeniable signature scheme. The scheme does not suffer from the key escrow problem, which is inherent in identity based crypto...
Shanshan Duan