22 search results - page 4 / 5 » Unsatisfiable Linear CNF Formulas Are Large and Complex |
ATAL
2006
Springer
13 years 10 months ago
2006
Springer
Qualitative Coalitional Games (QCGs) are a version of coalitional games in which an agent's desires are represented as goals which are either satisfied or unsatisfied, and ea...
FOCS
1999
IEEE
13 years 11 months ago
1999
IEEE
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
ACNS
2010
Springer
13 years 8 months ago
2010
Springer
In this work, we design two-party and multiparty protocols for evaluating multivariate polynomials at participants' inputs with security against a malicious adversary who may ...
DAC
2003
ACM
14 years 7 months ago
2003
ACM
Verification of system designs continues to be a major challenge today. Simulation remains the primary tool for making sure that implementations perform as they should. We present...