Sciweavers

607 search results - page 8 / 122
» Unifying Exact Completions
Sort
View
ECCC
2000
120views more  ECCC 2000»
14 years 10 months ago
A Complete Problem for Statistical Zero Knowledge
Abstract. We present the first complete problem for SZK, the class of promise problems possessing statistical zero-knowledge proofs (against an honest verifier). The problem, calle...
Amit Sahai, Salil P. Vadhan
ACSC
2004
IEEE
15 years 2 months ago
Towards the Completion of the Formal Semantics of OCL 2.0
The Object Constraint Language (OCL) is part of the Unified Modeling Language (UML) to specify restrictions on values of a given UML model. As part of the UML 2.0 standardization ...
Stephan Flake
CSR
2009
Springer
15 years 1 months ago
Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise ...
Olaf Beyersdorff, Zenon Sadowski
IPCO
1992
100views Optimization» more  IPCO 1992»
14 years 11 months ago
An Exact Characterization of Greedy Structures
We present exact characterizations of structures on which the greedy algorithm produces optimal solutions. Our characterization, which we call matroid embeddings, complete the par...
Paul Helman, Bernard M. E. Moret, Henry D. Shapiro
ENTCS
2006
107views more  ENTCS 2006»
14 years 10 months ago
Exact and Portable Profiling for the JVM Using Bytecode Instruction Counting
This paper presents a novel profiling approach, which is entirely based on program transformation techniques in order to enable exact profiling, preserving complete call stacks, m...
Walter Binder, Jarle Hulaas