1199 search results - page 205 / 240 » Parameterized Proof Complexity |
FOCS
2003
IEEE
14 years 2 months ago
2003
IEEE
We consider coGapSV P√ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM ∩coNP but is not known to be in NP or in MA. We prove th...
CONCUR
2003
Springer
14 years 2 months ago
2003
Springer
Patterns of Compositional Reasoning Nina Amla1 , E. Allen Emerson2 , Kedar Namjoshi3 , and Richard Trefler4 1 Cadence Design Systems 2 Univ. of Texas at Austin 3 Bell Labs, Lucent...
CRYPTO
2003
Springer
14 years 2 months ago
2003
Springer
Can you guarantee secrecy even if an adversary can eavesdrop on your brain? We consider the problem of protecting privacy in circuits, when faced with an adversary that can access ...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
ICALP
2010
Springer
14 years 1 months ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...