UB Paderborn / Katalog / Suche / in CDI

1 – 25 von 25

Sortiert nach

On Graph Isomorphism for Restricted Graph Classes

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

2006

Volltextzugriff (PDF)

On Hypergraph and Graph Isomorphism with Bounded Color Classes

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

2006

Volltextzugriff (PDF)

Average-case intractability vs. worst-case intractability

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

1998

Volltextzugriff (PDF)

Automatic Detection of Variable and Value Symmetries

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

1ère éd, 2005

Volltextzugriff (PDF)

Oblivious Symmetric Alternation

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

2006

Volltextzugriff (PDF)

Detecting and Breaking Symmetries by Reasoning on Problem Specifications

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

2005

Volltextzugriff (PDF)

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

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

Lindner, Wolfgang

2005

Volltextzugriff (PDF)

Competing Provers Yield Improved Karp-Lipton Collapse Results

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

2003

Volltextzugriff (PDF)

On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy: Positive and Negative Results

Computing and Combinatorics, 2003, p.202-211

2003

Volltextzugriff (PDF)

Learning DNFs and Circuits Using Teaching Assistants

Computing and Combinatorics, 2004, p.188-197

2004

Volltextzugriff (PDF)

One Bit of Advice

Lecture notes in computer science, 2003, p.547-558

2003

Volltextzugriff (PDF)

Some Results on Derandomization

Lecture notes in computer science, 2003, p.212-222

2003

Volltextzugriff (PDF)

Boolean NP-Partitions and Projective Closure

Discrete Mathematics and Theoretical Computer Science, 2003, p.225-236

2003

Volltextzugriff (PDF)

On Functions and Relations

Discrete Mathematics and Theoretical Computer Science, 2003, p.181-192

2003

Volltextzugriff (PDF)

Using Sequential Debugging Techniques with Massively Parallel Programs

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

2006

Volltextzugriff (PDF)

On Optimal Algorithms and Optimal Proof Systems

Lecture notes in computer science, 1999, p.541-550

1999

Volltextzugriff (PDF)

Separating the Notions of Self- and Autoreducibility

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

2005

Volltextzugriff (PDF)

PARADIS: Analysis of Transaction-Based Applications in Distributed Environments

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

2005

Volltextzugriff (PDF)

Equitable Colorings of Bounded Treewidth Graphs

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

2004

Volltextzugriff (PDF)

The Complexity of Equivalence and Isomorphism of Systems of Equations over Finite Groups

Lecture notes in computer science, 2004, Vol.3153, p.380-391

2004

Volltextzugriff (PDF)

Complexity Results in Graph Reconstruction

Lecture notes in computer science, 2004, p.287-297

2004

Volltextzugriff (PDF)

Solving Order Constraints in Logarithmic Space

Lecture notes in computer science, 2003, p.379-390

2003

Volltextzugriff (PDF)

Extending Downward Collapse from 1-versus-2 Queries to j-versus-j + 1 Queries

Lecture notes in computer science, 1999, p.270-280

1999

Volltextzugriff (PDF)

Tally NP sets and easy census functions

Lecture notes in computer science, 1998, p.483-492

1998

Volltextzugriff (PDF)

A second step towards circuit complexity-theoretic analogs of Rice's theorem

Lecture notes in computer science, 1998, p.418-426

1998

Volltextzugriff (PDF)

1 – 25 von 25

Suche als RSS-Feed

Aktive Filter

KollektionElektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals

SpracheRumänisch

Nur zeigenGeprüft (Peer-Review)

ThemaAlgorithmics. Computability. Computer Arithmetics

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Mit Volltextzugriff
(25)

Publikationsform

Sprache

Englisch
(25)

Erscheinungsjahr

n.n

Kollektion

1 weiteren anzeigen...

Weniger anzeigen...

Zeitschrift / Serie

Menü

Weitere Dienste

Einstellungen

On Graph Isomorphism for Restricted Graph Classes

On Hypergraph and Graph Isomorphism with Bounded Color Classes

Average-case intractability vs. worst-case intractability

Automatic Detection of Variable and Value Symmetries

Oblivious Symmetric Alternation

Detecting and Breaking Symmetries by Reasoning on Problem Specifications

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

Competing Provers Yield Improved Karp-Lipton Collapse Results

On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy: Positive and Negative Results

Learning DNFs and Circuits Using Teaching Assistants

One Bit of Advice

Some Results on Derandomization

Boolean NP-Partitions and Projective Closure

On Functions and Relations

Using Sequential Debugging Techniques with Massively Parallel Programs

On Optimal Algorithms and Optimal Proof Systems

Separating the Notions of Self- and Autoreducibility

PARADIS: Analysis of Transaction-Based Applications in Distributed Environments

Equitable Colorings of Bounded Treewidth Graphs

The Complexity of Equivalence and Isomorphism of Systems of Equations over Finite Groups

Complexity Results in Graph Reconstruction

Solving Order Constraints in Logarithmic Space

Extending Downward Collapse from 1-versus-2 Queries to j-versus-j + 1 Queries

Tally NP sets and easy census functions

A second step towards circuit complexity-theoretic analogs of Rice's theorem

Aktive Filter

Suchergebnisse filtern