#### Filter Results:

- Full text PDF available (17)

#### Publication Year

2002

2009

- This year (0)
- Last 5 years (0)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Alexander Hertel
- 2006

Tait and Tutte made famous conjectures stating that all members of certain graph classes contain Hamiltonian Cycles. Although the Tait and Tutte conjectures were disproved, Barnette continued thisâ€¦ (More)

In this paper we prove an exponential separation between two very similar and natural SAT encodings for the same problem, thereby showing that researchers must be careful when designing encodings,â€¦ (More)

- Alexander Hertel, Alasdair Urquhart
- CSL
- 2007

The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space needed to computeâ€¦ (More)

- Alexander Hertel
- 2008

Applications of Games to Propositional Proof Complexity Alexander Hertel Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2008 In this thesis we explore a number ofâ€¦ (More)

- Alexander Hertel
- 2004

Hamiltonian Cycles in Sparse Graphs Alexander Hertel Master of Science Graduate Department of Computer Science University of Toronto 2004 The subject of this thesis is the Hamiltonian Cycle problem,â€¦ (More)

We explore the proof complexity of intuitionistic propositional logic (IPL). The problem of determining whether or not an intuitionistic formula is valid is PSPACE-Complete via a reduction from QBF .â€¦ (More)

- Alexander Hertel, Alasdair Urquhart
- Electronic Colloquium on Computational Complexity
- 2009

The main argument of the report TR06-133 is in error. The paper claims to prove the result of the title by reduction from the (âˆƒ, k)-pebble game, shown to be EXPT IME-complete by Kolaitis andâ€¦ (More)

- Ulrike Stege, Iris van Rooij, Alexander Hertel, Philipp Hertel
- ISAAC
- 2002

We introduce the problem Profit Cover which finds application in, among other areas, psychology of decision-making. A common assumption is that net value is a major determinant of human choice.â€¦ (More)

- Alexander Hertel, Alasdair Urquhart
- Electronic Colloquium on Computational Complexity
- 2006

The importance of width as a resource in resolution theorem proving has been emphasized in the work of Ben-Sasson and Wigderson. Their results show that lower bounds on the size of resolutionâ€¦ (More)

- Alexander Hertel, Philipp Hertel, Charles G. Morgan
- Notre Dame Journal of Formal Logic
- 2007

There are simple, purely syntactic axiomatic proof systems for both the logical truths and the logical falsehoods of propositional logic. However, to date no such system has been developed for theâ€¦ (More)