Sciweavers

351 search results - page 22 / 71
» Classical proof forestry
Sort
View
SIGACT
2008
116views more  SIGACT 2008»
13 years 8 months ago
On-line bipartite matching made simple
We examine the classic on-line bipartite matching problem studied by Karp, Vazirani, and Vazirani [8] and provide a simple proof of their result that the Ranking algorithm for thi...
Benjamin E. Birnbaum, Claire Mathieu
CORR
2010
Springer
71views Education» more  CORR 2010»
13 years 6 months ago
On Various Negative Translations
Abstract. Several proof translations of classical mathematics into intuitionistic mathematics have been proposed in the literature over the past century. These are normally referre...
Gilda Ferreira, Paulo Oliva
TPHOL
2003
IEEE
14 years 2 months ago
First Order Logic with Domain Conditions
This paper addresses the crucial issue in the design of a proof development system of how to deal with partial functions and the related question of how to treat undefined terms. ...
Freek Wiedijk, Jan Zwanenburg
FOCS
2007
IEEE
14 years 3 months ago
Parameterized Proof Complexity
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
ECCC
2007
90views more  ECCC 2007»
13 years 8 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider