Logo Leibniz Universität Hannover
Logo:Institut für Theoretische Informatik
Logo Leibniz Universität Hannover
Logo:Institut für Theoretische Informatik
  • Zielgruppen
  • Suche
 

List of materials

A note on the size of Craig Interpolants

 

Jacobo Toran

Abstract, Proceedings Paper.

 

A rank technique for formula size lower bounds

 

Troy Lee

Abstract, Slides.

 

 

Algebraic Characterisation of TC0

 

Andreas Krebs

Abstract, Slides.

 

Branching Programs: Complexity Lower Bounds by Communication Games

 

Martin Sauerhoff

 

Abstract, Slides.

 

Characterization of Ehrenfeucht-Fraïssé equivalence for two classes of finite graphs

 

Malika More

Abstract, Slides.

 

Counting results in weak formalisms

 

Malika More

Abstract, Proceedings Paper.

 

Definability of Languages by Generalized First-order Formulas over (N,+)

 

Howard Straubing

Abstract.

 

 

Finite monoids, regular languages, circuit complexity and logic

 

Pascal Tesson

Abstract,

Slides,

Proceedings Paper.

 

FO[<] Uniformity

 

 

Christoph Behle

Abstract.

 

Games and Search Problems

 

Pavel Pudlak

Abstract, Slides.

 

Integer Addition, Circuits, Logic and Games

 

Michal Koucky

Abstract.

 

Model Theory on Well-Behaved Classes of Finite Structures

 

Anuj Dawar

Abstract, Slides.

 

 

On the size of Craig's Interpolant

 

Jacobo Toran

Abstract.

 

Some Algebraic Problems with Connections to Circuit Complexity of Dynamic Data Structures

 

William Hesse

Abstract, Proceedings Paper.

 

 

Some classes between NC1 and LogCFL

 

Meena Mahajan

Abstract, Slides.

 

Some Recent and Not-So-Recent Upper and Lower Bounds in Arithmetic Circuit Complexity

 

Eric Allender

 

Abstract.

 

Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words

 

Neil Immerman

Abstract, Proceedings Paper.

 

The expressive power of numerical predicates

 

 

Nicole Schweikardt

Abstract, Slides.