1274 search results - page 14 / 255 » New Proofs for |
COMBINATORICS
1998
15 years 5 days ago
1998
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...
102
click to vote
NDJFL
2000
15 years 7 days ago
2000
In this paper, we explore Fregean metatheory, what Frege called the New Science. The New Science arises in the context of Frege's debate with Hilbert over independence proofs ...
83
Voted
CSL
2002
Springer
15 years 8 days ago
2002
Springer
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...
123
Voted
TPHOL
2000
IEEE
15 years 4 months ago
2000
IEEE
Theorem provers for higher-order logics often use tactics to implement automated proof search. Tactics use a general-purpose metalanguage to implement both general-purpose reasonin...
79
Voted
PKC
2007
Springer
15 years 6 months ago
2007
Springer
We give a short constant-size group signature scheme, which we prove fully secure under reasonable assumptions in bilinear groups, in the standard model. We achieve this result by ...