2128 search results - page 71 / 426 » A general characterization of indulgence |
138
Voted
ECCC
2006
15 years 18 days ago
2006
We prove a number of general theorems about ZK, the class of problems possessing (computational) zero knowledge proofs. Our results are unconditional, in contrast to most previous...
118
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
—The paper proposes a framework for modeling and analysis of the dynamics of supply, demand, and clearing prices in power system with real-time retail pricing and information asy...
74
Voted
EUSFLAT
2007
15 years 2 months ago
2007
We propose a general semantic notion of modal many-valued logic. Then, we explore the difficulties to characterize this notation in a syntactic way and analyze the existing litera...
104
click to vote
CISS
2008
IEEE
15 years 7 months ago
2008
IEEE
—A general framework is developed for networks with flows that use all available congestion signals to regulate their rates. It is conceptually a generalization of the existing ...
116
click to vote
ECCC
2011
14 years 7 months ago
2011
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...