UB Paderborn / Katalog / Suche / in CDI

On Graph Isomorphism for Restricted Graph Classes

Lecture notes in computer science, 2006, p.241-256

Köbler, Johannes

2006

Link zum Volltext

Verfügbarkeit prüfen

On resource-bounded measure and pseudorandomness

Foundations of Software Technology and Theoretical Computer Science, 2006, p.235-249

Arvind, V.;Köbler, J.

2006

Link zum Volltext

Verfügbarkeit prüfen

On Hypergraph and Graph Isomorphism with Bounded Color Classes

Lecture notes in computer science, 2006, p.384-395

Arvind, V.;Köbler, Johannes

2006

Link zum Volltext

Verfügbarkeit prüfen

Average-case intractability vs. worst-case intractability

Lecture notes in computer science, 1998, p.493-502

Köbler, Johannes;Schuler, Rainer

1998

Link zum Volltext

Verfügbarkeit prüfen

On Distribution-Specific Learning with Membership Queries versus Pseudorandom Generation

FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science, 2000, p.336-347

Köbler, Johannes;Lindner, Wolfgang

2000

Link zum Volltext

Verfügbarkeit prüfen

Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results

Lecture notes in computer science, 2000, Vol.1770, p.431-442

Symposium on Theoretical Aspects of Computer Science;Reichel, Horst;Tison, Sophie

2000

Link zum Volltext

Verfügbarkeit prüfen

Nondeterministic Instance Complexity and Hard-to-Prove Tautologies

Lecture notes in computer science, 2000, Vol.1770, p.314-323

Symposium on Theoretical Aspects of Computer Science;Reichel, Horst;Tison, Sophie

2000

Link zum Volltext

Verfügbarkeit prüfen

De Bruijn graphs and DNA graphs

Lecture notes in computer science, 2001, p.296-305

Pendavingh, Rudi;Schuurman, Petra;Woeginger, Gerhard J;Brandstädt, A;Le, V.B

2001

Link zum Volltext

Verfügbarkeit prüfen

Automatic Detection of Variable and Value Symmetries

Lecture notes in computer science, 2005, p.475-489

Puget, Jean-François

2005

Link zum Volltext

Verfügbarkeit prüfen

Approximating Rank-Width and Clique-Width Quickly

Graph-Theoretic Concepts in Computer Science, 2005, p.49-58

Oum, Sang-il

2005

Link zum Volltext

Verfügbarkeit prüfen

The Complexity of Counting Functions with Easy Decision Version

Lecture notes in computer science, 2006, p.741-752

Pagourtzis, Aris;Zachos, Stathis

2006

Link zum Volltext

Verfügbarkeit prüfen

Detecting and Breaking Symmetries by Reasoning on Problem Specifications

Abstraction, Reformulation and Approximation, 2005, p.165-181

Mancini, Toni;Cadoli, Marco

2005

Link zum Volltext

Verfügbarkeit prüfen

Oblivious Symmetric Alternation

Lecture notes in computer science, 2006, p.230-241

Chakaravarthy, Venkatesan T.;Roy, Sambuddha

2006

Link zum Volltext

Verfügbarkeit prüfen

Computing the Tutte Polynomial on Graphs of Bounded Clique-Width

Graph-Theoretic Concepts in Computer Science, 2005, p.59-68

Giménez, Omer;Hliněný, Petr;Noy, Marc

2005

Link zum Volltext

Verfügbarkeit prüfen

Minimizing NLC-Width is NP-Complete

Graph-Theoretic Concepts in Computer Science, 2005, p.69-80

Gurski, Frank;Wanke, Egon

2005

Link zum Volltext

Verfügbarkeit prüfen

Using Sequential Debugging Techniques with Massively Parallel Programs

Computational Science – ICCS 2006, 2006, p.557-564

Schaubschläger, Christian;Kranzlmüller, Dieter;Volkert, Jens

2006

Link zum Volltext

Verfügbarkeit prüfen

Exploiting Fixable, Removable, and Implied Values in Constraint Satisfaction Problems

Lecture notes in computer science, 2005, p.270-284

Bordeaux, Lucas;Cadoli, Marco;Mancini, Toni

2005

Link zum Volltext

Verfügbarkeit prüfen

Learning DNF by Statistical and Proper Distance Queries Under the Uniform Distribution

Algorithmic Learning Theory, 2005, Vol.3734, p.198-210

Lindner, Wolfgang

2005

Link zum Volltext

Verfügbarkeit prüfen

An Algebraic Approach to the Complexity of Generalized Conjunctive Queries

Lecture notes in computer science, 2005, p.30-45

Bauland, Michael;Chapdelaine, Philippe;Creignou, Nadia;Hermann, Miki;Vollmer, Heribert

2005

Link zum Volltext

Verfügbarkeit prüfen

Hardness Hypotheses, Derandomization, and Circuit Complexity

FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004, p.336-347

Hitchcock, John M.;Pavan, A.

2004

Link zum Volltext

Verfügbarkeit prüfen

PARADIS: Analysis of Transaction-Based Applications in Distributed Environments

Computational Science – ICCS 2005, 2005, p.124-131

Glasner, Christian;Spiegl, Edith;Volkert, Jens

2005

Link zum Volltext

Verfügbarkeit prüfen

Coloring Powers of Graphs of Bounded Clique-Width

Graph-Theoretic Concepts in Computer Science, 2003, p.370-382

Todinca, Ioan

2003

Link zum Volltext

Verfügbarkeit prüfen

Separating the Notions of Self- and Autoreducibility

Lecture notes in computer science, 2005, p.308-315

Faliszewski, Piotr;Ogihara, Mitsunori

2005

Link zum Volltext

Verfügbarkeit prüfen

Competing Provers Yield Improved Karp-Lipton Collapse Results

Lecture notes in computer science, 2003, p.535-546

Cai, Jin-Yi;Chakaravarthy, Venkatesan T.;Hemaspaandra, Lane A.;Ogihara, Mitsunori

2003

Link zum Volltext

Verfügbarkeit prüfen

Equitable Colorings of Bounded Treewidth Graphs

Lecture notes in computer science, 2004, p.180-190

Bodlaender, Hans L.;Fomin, Fedor V.

2004

Link zum Volltext

Verfügbarkeit prüfen

On Graph Isomorphism for Restricted Graph Classes

On resource-bounded measure and pseudorandomness

On Hypergraph and Graph Isomorphism with Bounded Color Classes

Average-case intractability vs. worst-case intractability

On Distribution-Specific Learning with Membership Queries versus Pseudorandom Generation

Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results

Nondeterministic Instance Complexity and Hard-to-Prove Tautologies

De Bruijn graphs and DNA graphs

Automatic Detection of Variable and Value Symmetries

Approximating Rank-Width and Clique-Width Quickly

The Complexity of Counting Functions with Easy Decision Version

Detecting and Breaking Symmetries by Reasoning on Problem Specifications

Oblivious Symmetric Alternation

Computing the Tutte Polynomial on Graphs of Bounded Clique-Width

Minimizing NLC-Width is NP-Complete

Using Sequential Debugging Techniques with Massively Parallel Programs

Exploiting Fixable, Removable, and Implied Values in Constraint Satisfaction Problems

Learning DNF by Statistical and Proper Distance Queries Under the Uniform Distribution

An Algebraic Approach to the Complexity of Generalized Conjunctive Queries

Hardness Hypotheses, Derandomization, and Circuit Complexity

PARADIS: Analysis of Transaction-Based Applications in Distributed Environments

Coloring Powers of Graphs of Bounded Clique-Width

Separating the Notions of Self- and Autoreducibility

Competing Provers Yield Improved Karp-Lipton Collapse Results

Equitable Colorings of Bounded Treewidth Graphs

Aktive Filter

Suchergebnisse filtern