Sciweavers

1818 search results - page 48 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
DAM
2007
91views more  DAM 2007»
13 years 8 months ago
A note on the precedence-constrained class sequencing problem
We give a short proof of a result of Tovey [6] on the inapproximability of a scheduling problem known as precedence constrained class sequencing. In addition, we present an approxi...
José R. Correa, Samuel Fiorini, Nicol&aacut...
CORR
2002
Springer
67views Education» more  CORR 2002»
13 years 8 months ago
The prospects for mathematical logic in the twenty-first century
Abstract. The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory a...
Samuel R. Buss, Alexander S. Kechris, Anand Pillay...
COMBINATORICS
1998
102views more  COMBINATORICS 1998»
13 years 8 months ago
Inclusion-Exclusion and Network Reliability
Based on a recent improvement of the inclusion-exclusion principle, we present a new approach to network reliability problems. In particular, we give a new proof of a result of Sh...
Klaus Dohmen
IPL
2011
130views more  IPL 2011»
13 years 3 months ago
On the cryptanalysis of the hash function Fugue: Partitioning and inside-out distinguishers
Fugue is an intriguing hash function design with a novel shift-register based compression structure and has formal security proofs e.g. against collision attacks. In this paper, w...
Jean-Philippe Aumasson, Raphael C.-W. Phan
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
13 years 8 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan