424 search results - page 5 / 85 » Realizability models and implicit complexity |
ICTAI
2005
IEEE
14 years 1 months ago
2005
IEEE
A large number of practical applications rely on effective algorithms for propositional model enumeration and counting. Examples include knowledge compilation, model checking and ...
CGI
1998
IEEE
13 years 11 months ago
1998
IEEE
This paper describes an incremental polygonization technique for implicit surfaces built from skeletal elements. Our method lends itself for an interactive modeling system as the ...
SIGECOM
2010
ACM
14 years 8 days ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
ESORICS
2005
Springer
14 years 1 months ago
2005
Springer
The abstraction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols. Recently si...
ICCAD
1999
IEEE
13 years 11 months ago
1999
IEEE
Interconnect reduction is an important step in the design and analysis of complex interconnects found in present-day integrated circuits. This paper presents techniques for obtain...