1199 search results - page 77 / 240 » Parameterized Proof Complexity |
128
Voted
IWPEC
2009
Springer
15 years 9 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
116
click to vote
COMPGEOM
2007
ACM
15 years 6 months ago
2007
ACM
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
145
click to vote
HPCA
2006
IEEE
16 years 2 months ago
2006
IEEE
As silicon technologies move into the nanometer regime, transistor reliability is expected to wane as devices become subject to extreme process variation, particle-induced transie...
133
Voted
IACR
2011
14 years 2 months ago
2011
Abstract. Tampering attacks are cryptanalytic attacks on the implementation of cryptographic algorithms (e.g., smart cards), where an adversary introduces faults with the hope that...
126
Voted
SIAMCOMP
1998
15 years 2 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...