Sciweavers

33 search results - page 1 / 7
» Characterizing the Existence of Optimal Proof Systems and Co...
Sort
View
CSR
2009
Springer
13 years 10 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
COCO
2003
Springer
135views Algorithms» more  COCO 2003»
14 years 22 days ago
Disjoint NP-Pairs
We study the question of whether the class DisjNP of disjoint pairs (A, B) of NP-sets contains a complete pair. The question relates to the question of whether optimal proof system...
Christian Glaßer, Alan L. Selman, Samik Seng...
IOR
2008
128views more  IOR 2008»
13 years 7 months ago
Promised Lead-Time Contracts Under Asymmetric Information
We study the important problem of how a supplier should optimally share the consequences of demand uncertainty (i.e., the cost of inventory excesses and shortages) with a retailer...
Holly Lutze, Özalp Özer
CSL
2010
Springer
13 years 8 months ago
On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...
Yijia Chen, Jörg Flum
LICS
2010
IEEE
13 years 5 months ago
A Sound and Complete Calculus for Finite Stream Circuits
Stream circuits are a convenient graphical way to represent streams (or stream functions) computed by finite dimensional linear systems. We present a sound and complete expression...
Stefan Milius