1199 search results - page 44 / 240 » Parameterized Proof Complexity |
SIGOPSE
2004
ACM
14 years 2 months ago
2004
ACM
Configuration is the process whereby components are assembled or adjusted to produce a functional system that operates at a specified level of performance. Today, the complexity o...
AAAI
2012
11 years 11 months ago
2012
We extend work by Christian et al. [Review of Economic Design 2007] on lobbying in multiple referenda by first providing a more fine-grained analysis of the computational comple...
CIE
2008
Springer
13 years 10 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
This paper presents a novel method for reconstructing complex 3D objects with unknown topology using silhouettes extracted from image sequences. This method exploits the duality p...
FSTTCS
2000
Springer
14 years 9 days ago
2000
Springer
Abstract. This paper presents the first formal verification of the RicartAgrawala algorithm [RA81] for distributed mutual exclusion of an arbitrary number of nodes. It uses the Tem...