1199 search results - page 176 / 240 » Parameterized Proof Complexity |
91
Voted
FSTTCS
2008
Springer
15 years 1 months ago
2008
Springer
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 ...
79
Voted
CORR
2008
Springer
15 years 27 days ago
2008
Springer
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...
119
click to vote
ENTCS
2008
15 years 26 days ago
2008
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...
DAM
2006
15 years 25 days ago
2006
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...
125
Voted
ISCI
2008
15 years 24 days ago
2008
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...