Sciweavers

199 search results - page 27 / 40
» Denotations for Classical Proofs - Preliminary Results
Sort
View
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
13 years 11 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
VMCAI
2005
Springer
14 years 1 months ago
Checking Herbrand Equalities and Beyond
A Herbrand equality between expressions in a program is an equality which holds relative to the Herbrand interpretation of operators. We show that the problem of checking validity ...
Markus Müller-Olm, Oliver Rüthing, Helmu...
FOCS
2002
IEEE
14 years 17 days ago
Covering Problems with Hard Capacities
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
Julia Chuzhoy, Joseph Naor
CORR
2010
Springer
173views Education» more  CORR 2010»
13 years 7 months ago
Local search for stable marriage problems
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more genera...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
JACM
2000
81views more  JACM 2000»
13 years 7 months ago
Relational queries over interpreted structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin