Sciweavers

2607 search results - page 291 / 522
» Complete Functional Synthesis
Sort
View
CI
2004
116views more  CI 2004»
15 years 4 months ago
Solution Generation with Qualitative Models of Preferences
We consider automated decision aids that help users select the best solution from a large set of options. For such tools to successfully accomplish their task, eliciting and repre...
Boi Faltings, Marc Torrens, Pearl Pu
JELIA
2010
Springer
15 years 2 months ago
Sets of Boolean Connectives That Make Argumentation Easier
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
Nadia Creignou, Johannes Schmidt, Michael Thomas, ...
CORR
2011
Springer
167views Education» more  CORR 2011»
14 years 11 months ago
Fully Simulatable Quantum-Secure Coin-Flipping and Applications
We propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatable against poly-sized quantum adversaries on both sides. It can be implemented ...
Carolin Lunemann, Jesper Buus Nielsen
COCO
2011
Springer
216views Algorithms» more  COCO 2011»
14 years 4 months ago
Linear Systems over Finite Abelian Groups
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
Arkadev Chattopadhyay, Shachar Lovett
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
16 years 4 months ago
Gowers uniformity, influence of variables, and PCPs
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
Alex Samorodnitsky, Luca Trevisan