- Institut fur Theoretische Informatik WS 2008/2009 Dr. Olaf Beyersdorff 10. Dezember 2008
- 1 Eine Sprache L ist kontextsensitiv (Typ 1) gdw. es einen LBA gibt mit L(M) = L
- The Descriptive Complexity Approach to LOGCFL Clemens Lautemann , Pierre McKenzie y ,
- Masterarbeit Logics for Context-Free
- Quantenrechner Wintersemester 2005/2006
- EXTENSIONAL UNIFORMITY FOR BOOLEAN CIRCUITS PIERRE MCKENZIE, MICHAEL THOMAS, AND HERIBERT VOLLMER
- Kryptographie Sommersemester 2005
- Arithmetic Circuits and Polynomial Replacement Systems Pierre McKenzie
- Introduction to Circuit Complexity: Errata & Addenda (July 12, 2005)
- Curriculum Vit Name: Heribert Vollmer
- Optimal Satis ability for Propositional Calculi and Constraint Satisfaction Problems
- First-Oder Logic with Groupoidal Quanti ers Heribert Vollmer
- Einfuhrung in die Theorie der NPVollstandigkeit Sommersemester 2002
- MEASURE ONE RESULTS IN COMPUTATIONAL COMPLEXITY THEORY 1
- Studienarbeit Ein berblick
- The Satanic Notations: Counting Classes Beyond #P and Other De nitional Adventures
- Table of Contents Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1
- Institut fr Informationssysteme Universitt Hannover Diplomarbeit
- Leibniz Universitat Hannover Fakultat fur Elektrotechnik und Informatik
- Komplexittstheorie Wintersemester 2008/2009
- Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be
- Boolean Functions and Post's Lattice with Applications to Complexity Theory
- Blattsprachen und endliche Automaten Matthias Galota
- A Note on Closure Properties of Logspace MOD Classes
- The Chain Method to Separate Counting Classes Katja Cronauer
- Entscheidungsprobleme in der autoepistemischen Logik
- Bibliography [Adl78] L. Adleman. Two theorems on random polynomial time. In Pro
- Kryptographie Sommersemester 2005
- Sommersemester 2009 Institut fr Theoretische Informatik
- The Gap-Language-Technique Heribert Vollmer
- Institut fur Theoretische Informatik WS 2008/2009 Dr. Olaf Beyersdorff 3. Dezember 2008
- Complexity Classes of Optimization Functions 1 Heribert Vollmer and Klaus W. Wagner
- Relating Polynomial Time to Constant Depth \Lambda Heribert Vollmer
- Diplomarbeit Fragments of Temporal Logic
- Proof Complexity of Propositional Default Logic Olaf Beyersdorff1, Arne Meier2, Sebastian Muller3, Michael Thomas2, and
- Introduction to Circuit Complexity: Errata & Addenda (July 12, 2005)
- Modulkatalog fur den Studiengang
- Alle Hochschulmitglieder und -angehrigen sollten darauf achten, dass sexuelle Belstigungen unterbleiben bzw. abgestellt werden.
- Die Komplexitt der Modellprfung fr Default-Aussagenlogik
- The Weak Base Method for Constraint Satisfaction
- Generic Separations and Leaf Languages M. Galota, S. Kosub, H. Vollmer
- Partially-ordered Two-way Automata: A New Characterization of DA
- Average-Case Computations Comparing AvgP, HP, and Nearly-P Arfst Nickelsen
- The Complexity of the Boolean Formula Value Problem Henning Schnoor
- The Complexity Base Station Positioning in Cellular Networks
- Nondeterministic NC 1 computation Herv e Caussinus and Pierre McKenzie
- FirstOder Logic with Groupoidal Quantifiers Lecture Notes for ``Logic and Circuit Complexity''
- Ist P = NP? uhrung in die Theorie der
- The Complexity of Reasoning for Fragments of Default Logic
- A Tight Karp-Lipton Collapse Result in Bounded Arithmetic
- Appendix: Mathematical Preliminaries A1 Alphabets, Words, Languages
- Enumerating all Solutions for Constraint Satisfaction Henning Schnoor and Ilka Schnoor
- Schaltkreiskomplexitat Wintersemester 2002/2003
- 3.3 Lower Bounds for ConstantDepth Circuits 97 Lemma 3.27. There is an n 0 0 such that for all n ? n 0 , the number of
- Algebraic Techniques for Satisfiability Problems
- Generic Separations and Leaf Languages Matthias Galota 1 , Sven Kosub 2 , and Heribert Vollmer 1
- The Complexity of Satisfiability for Fragments of Hybrid Logic --Part I
- Formale Sprachen Sommersemester 2002
- Probabilistic Type2 Operators and ``Almost''Classes \Lambda Ronald V. Book y Heribert Vollmer z Klaus W. Wagner z
- Formale Sprachen Wintersemester 2003/2004
- Komplexitatsresultate von Description Logics Diplomarbeit
- Base Station Positioning in UMTS Networks: an Optimization Framework ?
- Leibniz Universitt Hannover Fakultt fr Elektrotechnik und Informatik
- Eine k-Band-DTM ist ein 7-Tupel M = (Z, , , , z0, , E),
- Cryptographic Hash Functions Diplomarbeit
- Universitt Hannover Institut fr Theoretische Informatik
- Evaluating Online Scheduling Techniques in Uncertain Environments
- Sommersemester 2009 Institut fr Theoretische Informatik
- Institut fur Informationssysteme Universitat Hannover Diplomarbeit
- Kryptographie Sommersemester 2005
- Modes of Operation: Der Cipher Feedback Steffen Reith
- International Journal of Foundations of Computer Science fl World Scientific Publishing Company
- Kryptographie Sommersemester 2005
- Equivalence and Isomorphism for Boolean Constraint Satisfaction ?
- Complexity of Non-Monotonic Logics Michael Thomas and Heribert Vollmer
- Generating Multicollisions for MD4 and MD5
- Berechenbarkeit und Logik Sommersemester 2009
- Leibniz-Universitat Hannover Institut fur Theoretische Informatik
- Berechenbarkeit und Logik Sommersemester 2009
- PSPACE-completeness of LTL/CTL model checking
- On the Power of NumberTheoretic Operations with Respect to Counting
- L osung zur Klausur '' Grundlagen der Theoretischen Informatik`` 1. Geben Sie einen deterministischen endlichen Automaten an, der genau die Worter
- Formale Sprachen Wintersemester 2003/2004
- Recursion Theoretic Characterizations of Complexity Classes of Counting Functions
- Leibniz-Universitat Hannover Institut fur Theoretische Informatik
- Boolean Constraint Satisfaction Problems or: When does Post's Lattice Help?
- Einfuhrung in die Theorie der NP-Vollstandigkeit Sommersemester 2002
- Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
- The Deduction Theorem for Strong Propositional Proof Systems
- An Algebraic Approach to the Complexity of Generalized Conjunctive Queries
- Boolean Functions and Post's Lattice with Applications to Complexity Theory
- Formale Sprachen Sommersemester 2002
- Model Checking CTL is Almost Always Inherently Sequential Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk and Thomas Schneider
- Universitt Hannover Institut fr Theoretische Informatik
- Sommersemester 2008 Institut fr Theoretische Informatik
- Complexity Theory Made Easy The Formal Language Approach to the Definition of
- Functions Computable Polynomial Space Matthias Galota and Heribert Vollmer
- Approximierbarkeit Ein Optimierungsproblem P ist gegeben durch ein Quadrupel
- On Second-Order Monadic Groupoidal Quantifiers
- Komplexitatstheorie Wintersemester 2004/05
- Gottfried Wilhelm Leibniz Universitt Hannover Fakultt fr Elektrotechnik und Informatik
- The Complexity of Satisfiability for Fragments of CTL and CTL 1
- Seminar: Parameterisierte Komplexitat SS 07 Prof. H. Vollmer
- Algebraic and logical characterization of star-free Thomas Zeume
- Institut fur Informationssysteme Universitat Hannover Diplomarbeit
- The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments
- Modulkatalog fur den Studiengang
- Lindstr om Quantifiers and Leaf Language Definability
- Formale Sprachen Sommersemester 2002
- Uniform Characterizations of Complexity Classes of Functions Sven Kosub Heinz Schmitz Heribert Vollmer
- Quantenrechner Wintersemester 2005/2006
- Komplexitt von Algorithmen Sommersemester 2009
- Komplexitt von Algorithmen Sommersemester 2009
- Formale Sprachen Wintersemester 2005/2006
- Leibniz Universitt Hannover 20.12.2006 Institut fr Theoretische Informatik
- Generalized Quantifiers in Computational Complexity Theory
- A Generalization of the Buchi-Elgot-Trakhtenbrot Theorem
- This introductory textbook presents an algorithmic and computability based approach to circuit complexity. Intertwined with the consideration of prac
- On Balanced vs. Unbalanced Computation Trees \Lambda Ulrich Hertrampf y Heribert Vollmer z Klaus W. Wagner y
- On the Power of Polynomial Time Bit-Reductions Extended Abstract
- GapLanguages and LogTime Complexity Classes Kenneth W. Regan \Lambda
- A PolynomialTime Approximation Scheme for Base Station Positioning in UMTS Networks
- On Different Reducibility Notions for Function Classes ?
- Formale Sprachen Wintersemester 2003/2004
- Name: Heribert Antonius Vollmer Adresse: Theoretische Informatik
- Grundlagen der Theoretischen Informatik Wintersemester 2007 / 2008
- Die Programmiersprache LOOP Syntaktische Komponenten von LOOP
- Institut fur Theoretische Informatik WS 2008/2009 Dr. Olaf Beyersdorff 21. Januar 2009
- Komplexitt von Algorithmen Sommersemester 2008
- Institut fur Theoretische Informatik WS 2008/2009 Dr. Olaf Beyersdorff 19. November 2008
- Institut fur Theoretische Informatik SS 2008 Dr. Olaf Beyersdorff 27. Mai 2008
- Generalized Modal Satisfiability Michael Bauland1
- Komplexitatstheorie Wintersemester 2006/07
- Uniform Characterizations of Complexity Classes Heribert Vollmer \Lambda
- Gottfried Wilhelm Leibniz Universitat Hannover Fakultat fur Elektrotechnik und Informatik
- Reductions and Parameterized Intractability Seminar Parameterisierte Komplexitat
- Complexity in Dependence Logic Diplomarbeit
- Leibniz Universitt Hannover Institut fr Theoretische Informatik
- Entscheidbarkeit und Komplexitt logischen Folgerns in autoepistemischen Logiken
- Leibniz Universitt Hannover Fakultt fr Elektrotechnik und Informatik
- Diplomarbeit Enumeration: Algorithms and Complexity
- Entscheidbarkeitsprobleme in der Default Logik
- Master's Thesis Complexity of Temporal Logics
- Studienarbeit: Laufzeitanalyse des SAT-Algorithmus
- Complexity Results for Boolean Constraint Satisfaction
- ,, Bachelorarbeit" im Fach Mathematik. Universitt Hannover.
- Master's Thesis Autoreducibility and Friends
- Bachelorarbeit Algorithmen fur endliche Automaten
- Generalized Satisfiability for the Description Logic ALC
- Sets of Boolean Connectives that make Argumentation Easier
- Comparing Axiomatizations of Free Pseudospaces Olaf Beyersdorff
- On the Existence of Complete Disjoint NP-Pairs Olaf Beyersdorff
- The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates
- The Complexity of Default Logic on Generalized Conjunctive Queries
- Computational Complexity of Constraint Satisfaction
- Complexity of Nonmonotonic Logics An Incomplete Survey Birgit Schelm
- Playing with Boolean Blocks, Part II: Constraint Satisfaction Problems1
- Playing with Boolean Blocks, Part I: Post's Lattice with Applications to Complexity Theory1
- Fragments of Temporal Logic and Formal Languages
- Inaugural Dissertation Erlangung der Doktorwurde
- The Complexity of Generalized Satisfiability for Linear Temporal Logic
- Institut fur Theoretische Informatik WS 2007/2008 Dr. Olaf Beyersdorff 21. November 2007
- Institut fur Theoretische Informatik WS 2008/2009 Dr. Olaf Beyersdorff 26. November 2008
- Institut fur Theoretische Informatik WS 2008/2009 Dr. Olaf Beyersdorff 14. Januar 2009
- Formale Sprachen Wintersemester 2003/2004
- Formale Sprachen Wintersemester 2003/2004
- Grundlagen der Theoretischen Informatik Wintersemester 2008/2009
- Grundlagen der Theoretischen Informatik Woche 9 Die Binardarstellung sei ohne fuhrende Nullen und mit dem most significant bit links vom least significant
- Komplexitt von Algorithmen Sommersemester 2009
- Komplexitt von Algorithmen Sommersemester 2008
- Komplexitt von Algorithmen Sommersemester 2008
- Universitt Hannover Institut fr Theoretische Informatik
- Universitt Hannover Institut fr Theoretische Informatik
- Komplexittstheorie Wintersemester 2008/2009
- Vorlesung Kryptographie Institut fur Theoretische Informatik Sommersemester 2007 Universitat Hannover
- Kryptographie Sommersemester 2005
- Kryptographie Sommersemester 2005
- Sommersemester 2009 Institut fr Theoretische Informatik
- Sommersemester 2008 Institut fr Theoretische Informatik
- FPT-Algorithmeng Jurij Schachmanow
- Seminar: Logik und Komplexitt von: Thomas Zeume
- Wiederholung p-CLIQUE ist A[1]-hart p-SET-PACKING ist A[1]-vollstandig p-HOM ist A[1]-vollstandig 1/24 A[1]-vollstandige Probleme (S. 106-114)
- Leibniz Universitt Hannover Institut fr Theoretische Informatik
- Leibniz Universitt Hannover 06.12.2006 Institut fr Theoretische Informatik
- Selbstreduzierbarkeit (von Joachim Selke, Mai 2005) Fnfter Vortrag im Rahmes des Seminars ,,Perlen der Komplexittstheorie"
- Theorie Boolescher Schaltkreise Sommersemester 2008
- Theorie Boolescher Schaltkreise Sommersemester 2008
- Theorie Boolescher Schaltkreise Sommersemester 2004
- Schaltkreiskomplexitat Wintersemester 2002/2003
- Berechenbarkeit und Logik Sommersemester 2009
- Kryptographie Sommersemester 2005
- Komplexitt von Algorithmen Sommersemester 2008
- Einfuhrung in die Theorie der NP-Vollstandigkeit Sommersemester 2002
- Quantenrechner Wintersemester 2005/2006
- Counting Classes and the Fine Structure between NC1
- Bases for Boolean Co-Clones Elmar Bohler
- The Complexity of Circumscriptive Inference in Post's Lattice
- Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation
- Prsidialstab Hochschulplanung und Controlling (PS 4) Hochschulpakt 2020
- A l u m n i C a m p u sH a n n o v e r Am 16. April 2011 trafen sich bei strahlender Vormittagssonne Ehemalige
- Leibniz Universitat Hannover Fakultat fur Elektrotechnik und Informatik
- Enumerating all Solutions for Constraint Satisfaction Henning Schnoor, Ilka Schnoor
- Characterizing the Existence of Optimal Proof Systems and
- Proof Systems that Take Advice Olaf Beyersdorff
- Verkndungsblatt 26|2011 Ausgabedatum 23.11.2011
- Das Prsidium Abgabe von Gerten
- Introduction High Failure Rate for Cuckoo Hashing with too
- Tight Bounds for Blind Search on the Integers
- Model Checking CTL is Almost Always Inherently Sequential Olaf Beyersdorff Arne Meier Michael Thomas Heribert Vollmer
- Introduction The Uniformity Duality Property The Duality Beyond Regular Languages Conclusion The Uniformity Duality Property
- A Unified Theory of Structural Tractability for Constraint Satisfaction Problems
- Constraint Satisfaction with Succinctly Specified Hubie Chen and Martin Grohe
- A note on the size of Craig Interpolants Uwe Schoning and Jacobo Toran
- Fakultt Elektrotechnik und Informatik SOKRATES/ERASMUS Bilateral Agreements
- The Complexity of Reasoning for Fragments of Default Logic
- Smoothed Analysis of Trie Height AG Theorie komplexer Systeme
- Proofs and Games Olaf Beyersdorff
- Doctorate Regulations of the Faculty of Natural Sciences, the Faculty of Mathematics and Physics, and the Faculty of Electrical Engineering and Computer Science
- The Deduction Theorem for
- New Algebraic Tools for Constraint Satisfaction Henning Schnoor, Ilka Schnoor
- Vereinbarung zur Software-berlassung Datum: X-Win32 RRZN-Vertragsnr.
- Nondeterministic Instance Complexity and Proof Systems with Advice
- Structure Theorem and Strict Alternation Hierarchy for FO2
- Closure Properties of Proof Systems
- Vereinbarung zur Software-berlassung Datum: SYSTAT-Software RRZN-Vertragsnr.
- Karp-Lipton Collapse Results Complexity Classes in Bounded Arithmetic
- Verkndungsblatt 21|2011 Ausgabedatum 28.09.2011
- Counting Results in Weak Formalisms? Arnaud Durand1
- Some fixed-parameter tractable classes of hypergraph duality and related problems
- Approximating Almost All Instances of Max-Cut within a Ratio Above the Hastad
- Vereinbarung zur Software-berlassung Datum: SHAZAM RRZN-Vertragsnr.
- INTERNATIONAL VISITING SCIENTISTS AT LEIBNIZ UNIVERSITT HANNOVER
- Bridges between Algebraic Automata Theory and Complexity Theory
- Leibniz-Stiftungsprofessur Komma und Kathedrale
- Verkndungsblatt 27|2011 Ausgabedatum 19.12.2011
- Leibniz Universitt Hannover Wintersemester 2011/2012
- Verkndungsblatt 2|2012 Ausgabedatum 20.02.2012
- Das Prsidium Abgabe von Gerten
- Guidelines on Bias Issues in Appointment Processes (to be forwarded to appointment committee members and external reviewers)
- A l u m n i C a m p u sh a n n o v e r Zu Gast bei max und moritz
- -Seite 1 von 3-Leibniz Universitt Hannover Bitte zurcksenden oder per Fax an
- A l u m n i C a m p u s C o m m u n i t y Bereits zum zweiten Mal ffnete das Laboratorium fr nano-und Quan-
- ThI Institut fr Theoretische Informatik
