Sciweavers

63 search results - page 2 / 13
» 06111 Abstracts Collection -- Complexity of Boolean Function...
Sort
View
FSTTCS
2009
Springer
14 years 2 months ago
Non-Local Box Complexity and Secure Function Evaluation
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, ...
JELIA
2010
Springer
13 years 6 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, ...
JUCS
2006
107views more  JUCS 2006»
13 years 7 months ago
Testing Membership in Formal Languages Implicitly Represented by Boolean Functions
Abstract: Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [Goldreich et al. (1998)] and inspired by Rubinfeld and Sudan in [Rubinfeld and Su...
Beate Bollig
DLOG
2009
13 years 5 months ago
A Combination of Boolean Games with Description Logics for Automated Multi-Attribute Negotiation
Abstract. Multi-attribute negotiation has been extensively studied from a gametheoretic viewpoint. In negotiation settings, utility functions are used to express agent preferences....
Thomas Lukasiewicz, Azzurra Ragone
ECAL
2003
Springer
14 years 23 days ago
Critical Values in Asynchronous Random Boolean Networks
Abstract Wherever we see life, we see different kinds of complex networks, reason why they are studied across various fields of science. Random Boolean Networks (RBNs) form a spe...
Bertrand Mesot, Christof Teuscher