Sciweavers

325 search results - page 13 / 65
» Proofs of Restricted Shuffles
Sort
View
KI
1995
Springer
15 years 3 months ago
What Is a Skeptical Proof?
Abstract. We investigate the task of skeptically reasoning in extensionbased, nonmonotonic logics by concentrating on general argumentation theories. The restricted applicability o...
Michael Thielscher
LATINCRYPT
2010
14 years 10 months ago
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yer...
BSL
2004
100views more  BSL 2004»
14 years 11 months ago
Forcing in proof theory
Paul Cohen's method of forcing, together with Saul Kripke's related semantics for modal and intuitionistic logic, has had profound effects on a number of branches of mat...
Jeremy Avigad
MFCS
2007
Springer
15 years 5 months ago
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
Jaroslav Nesetril, Mark H. Siggers
JAIR
2007
65views more  JAIR 2007»
14 years 11 months ago
The Strategy-Proofness Landscape of Merging
Merging operators aim at defining the beliefs/goals of a group of agents from the beliefs/goals of each member of the group. Whenever an agent of the group has preferences over t...
Patricia Everaere, Sébastien Konieczny, Pie...