Sciweavers

3172 search results - page 24 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
94
Voted
IPL
2006
83views more  IPL 2006»
15 years 19 days ago
The Pair Completion algorithm for the Homogeneous Set Sandwich Problem
A homogeneous set is a non-trivial module of a graph, i.e. a nonempty, non-unitary, proper vertex subset such that all its elements present the same outer neighborhood. Given two ...
Claudson F. Bornstein, Celina M. Herrera de Figuei...
99
Voted
CSR
2009
Springer
15 years 3 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
87
Voted
STACS
1998
Springer
15 years 4 months ago
Optimal Proof Systems for Propositional Logic and Complete Sets
Jochen Meßner, Jacobo Torán
63
Voted
LICS
1997
IEEE
15 years 4 months ago
Complete Cuboidal Sets in Axiomatic Domain Theory
Marcelo P. Fiore, Gordon D. Plotkin, A. John Power