1199 search results - page 162 / 240 » Parameterized Proof Complexity |
111
Voted
EUROCRYPT
2000
Springer
15 years 4 months ago
2000
Springer
Voting schemes that provide receipt-freeness prevent voters from proving their cast vote, and hence thwart vote-buying and coercion. We analyze the security of the multi-authority ...
133
Voted
PLANX
2007
15 years 2 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
70
Voted
PICS
2001
15 years 2 months ago
2001
Banding can be a major defect in inkjet printing. Knowing the visual sensitivity threshold of inkjet banding is therefore useful for understanding and pushing the technological li...
96
Voted
CORR
2008
Springer
15 years 26 days ago
2008
Springer
The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...
83
Voted
DC
2008
15 years 25 days ago
2008
This paper introduces solo-valency, a variation on the valency proof technique originated by Fischer, Lynch, and Paterson. The new technique focuses on critical events that influe...