125 search results - page 5 / 25 » Model Theory Makes Formulas Large |
JC
2008
14 years 9 months ago
2008
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...
ELECTRONICMARKETS
2010
14 years 6 months ago
2010
We argue that certain theoretical commitments that underpin much existing Interorganisational Information Systems (IOIS) research at small scales become untenable when IOIS are st...
MANSCI
2007
14 years 9 months ago
2007
We develop a structural model of credit risk in a network economy, where any firm can lend to any other firm, so that each firm is subject to counterparty risk either from dire...
ENTCS
2007
14 years 9 months ago
2007
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...
PPDP
2010
Springer
14 years 7 months ago
2010
Springer
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...