1274 search results - page 68 / 255 » New Proofs for |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
This paper presents an improved analysis of a structured dimension-reduction map called the subsampled randomized Hadamard transform. This argument demonstrates that the map preser...
ENTCS
2008
13 years 7 months ago
2008
We study sequent calculi for propositional modal logics, interpreted over coalgebras, with admissibility of cut being the main result. As applications we present a new proof of th...
EJC
2006
13 years 7 months ago
2006
A class C of graphs is said to be H-bounded if each graph in the class C admits a homomorphism to H. We give a general necessary and sufficient condition for the existence of boun...
INFORMATICALT
2000
13 years 7 months ago
2000
An original algorithm for transformation of finite automata to regular expressions is presented. This algorithm is based on effective graph algorithms and gives a transparent new p...
ENTCS
2002
13 years 7 months ago
2002
This paper defines reduction on derivations in the strict intersection type assignment system of [2], by generalising cut-elimination, and shows a strong normalisation result for ...