Sciweavers

1274 search results - page 14 / 255
» New Proofs for
Sort
View
COMBINATORICS
1998
102views more  COMBINATORICS 1998»
13 years 7 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
NDJFL
2000
74views more  NDJFL 2000»
13 years 7 months ago
Frege's New Science
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 ...
Aldo Antonelli, Robert May
CSL
2002
Springer
13 years 7 months ago
On the Automatizability of Resolution and Related Propositional Proof Systems
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 ...
Albert Atserias, Maria Luisa Bonet
TPHOL
2000
IEEE
13 years 12 months ago
Fast Tactic-Based Theorem Proving
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...
Jason Hickey, Aleksey Nogin
PKC
2007
Springer
99views Cryptology» more  PKC 2007»
14 years 1 months ago
Full-Domain Subgroup Hiding and Constant-Size Group Signatures
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 ...
Xavier Boyen, Brent Waters