Sciweavers

5084 search results - page 152 / 1017
» Proving Possibility Properties
Sort
View
STOC
1995
ACM
108views Algorithms» more  STOC 1995»
15 years 10 months ago
A parallel repetition theorem
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...
Ran Raz
CORR
2007
Springer
116views Education» more  CORR 2007»
15 years 6 months ago
A presentation of Quantum Logic based on an "and then" connective
When a physicist performs a quantic measurement, new information about the system at hand is gathered. This presentation studies the logical properties of how this new information...
Daniel Lehmann
ECSQARU
2007
Springer
15 years 10 months ago
Information Affinity: A New Similarity Measure for Possibilistic Uncertain Information
Abstract. This paper addresses the issue of measuring similarity between pieces of uncertain information in the framework of possibility theory. In a first part, natural properties...
Ilyes Jenhani, Nahla Ben Amor, Zied Elouedi, Salem...
CSL
2007
Springer
16 years 15 days ago
Incorporating Tables into Proofs
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
Dale Miller, Vivek Nigam
FOCS
2008
IEEE
16 years 24 days ago
Almost-Natural Proofs
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
Timothy Y. Chow