2576 search results - page 223 / 516 » The Complexity of Zero Knowledge |
171
click to vote
AAAI
1990
15 years 7 months ago
1990
Troubleshooting problems in real manufacturing environments impose constraints on admissible solutions that make the computational solutions offered by "troubleshooting from ...
186
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
The paper applies modal logic to formalize fragments of argumentation theory. Such formalization allows to import, for free, a wealth of new notions (e.g., argument equivalence), ...
140
click to vote
DLOG
2009
15 years 7 months ago
2009
Abstract There are various techniques for specifying a module of an ontology that covers all knowledge about a given set of terms. These differ with respect to the size of the modu...
155
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL ∩ coUL [TW08]. In this paper, we give a determin...
179
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this report, we describe three encodings of the multiple constant multiplication (MCM) problem to pseudo-boolean satisfiability (PBS), and introduce an algorithm to solve the M...