en
de
Local
OpenID
:
no help available
no help available
BibSonomy
author
tag
user
group
author
concept
BibTeX key
search:all
::
Thierauf
::
The blue social bookmark and publication sharing system.
sign in
home
groups
popular
posts
tags
authors
concepts
discussions
actions for all displayed bookmarks:
export:
RSS
,
BibTeX
,
XML
sort:
criterion:
date
,
title
order:
ascending
,
descending
others:
bookmarks per page:
5
10
20
50
100
bookmarks
actions for all displayed publications:
export:
RSS
,
BibTeX
,
RDF
,
more...
sort:
criterion:
date
,
title
order:
ascending
,
descending
advanced...
others:
publications per page:
5
10
20
50
100
publications
(79)
tags
dblp
Betriebliche_Information_und_Kommunikation
imported
No matching items.
Algebraic and Combinatorial Methods in Computational Complexity Dagstuhl Seminar 12421.
Manindra Agrawal
,
Thomas Thierauf
, and
Christopher Umans
.
Dagstuhl Reports
2(10):60-78
(
2012
)
Manindra Agrawal
,
Thomas Thierauf
, and
Christopher Umans
.
Dagstuhl Reports
2(10):60-78
(
2012
)
3 months and a day ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
On Two-Level Poset Games.
Stephen A. Fenner
,
Rohit Gurjar
,
Arpita Korwar
, and
Thomas Thierauf
.
Electronic Colloquium on Computational Complexity ECCC
(
2013
)
Stephen A. Fenner
,
Rohit Gurjar
,
Arpita Korwar
, and
Thomas Thierauf
.
Electronic Colloquium on Computational Complexity ECCC
(
2013
)
3 months and 8 days ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Complexity Classes with Advice.
Johannes Köbler
, and
Thomas Thierauf
.
Structure in Complexity Theory Conference,
page 305-315.
IEEE Computer Society,
(
1990
)
Johannes Köbler
, and
Thomas Thierauf
.
Structure in Complexity Theory Conference,
page 305-315.
IEEE Computer Society,
(
1990
)
4 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
On Functions Computable with Nonadaptive Queries to NP.
Harry Buhrman
,
Jim Kadin
, and
Thomas Thierauf
.
Structure in Complexity Theory Conference,
page 43-52.
IEEE Computer Society,
(
1994
)
Harry Buhrman
,
Jim Kadin
, and
Thomas Thierauf
.
Structure in Complexity Theory Conference,
page 43-52.
IEEE Computer Society,
(
1994
)
4 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
The Complexity of Verifying the Characteristic Polynomial and Testing Similarity.
Thanh Minh Hoang
, and
Thomas Thierauf
.
IEEE Conference on Computational Complexity,
page 87-.
IEEE Computer Society,
(
2000
)
Thanh Minh Hoang
, and
Thomas Thierauf
.
IEEE Conference on Computational Complexity,
page 87-.
IEEE Computer Society,
(
2000
)
4 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Nonrelativizing Separations.
Harry Buhrman
,
Lance Fortnow
, and
Thomas Thierauf
.
IEEE Conference on Computational Complexity,
page 8-12.
IEEE Computer Society,
(
1998
)
Harry Buhrman
,
Lance Fortnow
, and
Thomas Thierauf
.
IEEE Conference on Computational Complexity,
page 8-12.
IEEE Computer Society,
(
1998
)
4 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
The Satisfiability Problem for Probabilistic Ordered Branching Programs.
Manindra Agrawal
, and
Thomas Thierauf
.
IEEE Conference on Computational Complexity,
page 81-.
IEEE Computer Society,
(
1998
)
Manindra Agrawal
, and
Thomas Thierauf
.
IEEE Conference on Computational Complexity,
page 81-.
IEEE Computer Society,
(
1998
)
4 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Restricted Information from Nonadaptive Queries to NP.
Yenjo Han
, and
Thomas Thierauf
.
Structure in Complexity Theory Conference,
page 206-213.
IEEE Computer Society,
(
1995
)
Yenjo Han
, and
Thomas Thierauf
.
Structure in Complexity Theory Conference,
page 206-213.
IEEE Computer Society,
(
1995
)
4 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
On Closure Properties of #P in the Context of PF°#P.
Mitsunori Ogiwara
,
Thomas Thierauf
,
Seinosuke Toda
, and
Osamu Watanabe
.
Structure in Complexity Theory Conference,
page 139-146.
IEEE Computer Society,
(
1993
)
Mitsunori Ogiwara
,
Thomas Thierauf
,
Seinosuke Toda
, and
Osamu Watanabe
.
Structure in Complexity Theory Conference,
page 139-146.
IEEE Computer Society,
(
1993
)
4 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Complements of Multivalued Functions.
Stephen A. Fenner
,
Frederic Green
,
Steven Homer
,
Alan L. Selman
,
Thomas Thierauf
, and
Heribert Vollmer
.
IEEE Conference on Computational Complexity,
page 260-269.
IEEE Computer Society,
(
1996
)
Stephen A. Fenner
,
Frederic Green
,
Steven Homer
,
Alan L. Selman
,
Thomas Thierauf
, and
Heribert Vollmer
.
IEEE Conference on Computational Complexity,
page 260-269.
IEEE Computer Society,
(
1996
)
4 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
A Kolmogorov complexity proof of the Lovász Local Lemma for satisfiability.
Jochen Messner
, and
Thomas Thierauf
.
Theor. Comput. Sci.
(
2012
)
Jochen Messner
, and
Thomas Thierauf
.
Theor. Comput. Sci.
(
2012
)
6 months and 13 days ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Nondeterministically Selective Sets.
Lane A. Hemaspaandra
,
Albrecht Hoene
,
Ashish V. Naik
,
Mitsunori Ogihara
,
Alan L. Selman
,
Thomas Thierauf
, and
Jie Wang
.
Int. J. Found. Comput. Sci.
6(4):403-416
(
1995
)
Lane A. Hemaspaandra
,
Albrecht Hoene
,
Ashish V. Naik
,
Mitsunori Ogihara
,
Alan L. Selman
,
Thomas Thierauf
, and
Jie Wang
.
Int. J. Found. Comput. Sci.
6(4):403-416
(
1995
)
8 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Planarizing Gadgets for Perfect Matching Do Not Exist.
Rohit Gurjar
,
Arpita Korwar
,
Jochen Messner
,
Simon Straub
, and
Thomas Thierauf
.
MFCS,
volume 7464 of Lecture Notes in Computer Science,
page 478-490.
Springer,
(
2012
)
Rohit Gurjar
,
Arpita Korwar
,
Jochen Messner
,
Simon Straub
, and
Thomas Thierauf
.
MFCS,
volume 7464 of Lecture Notes in Computer Science,
page 478-490.
Springer,
(
2012
)
9 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
The Complexity of the Minimal Polynomial
Thanh Minh Hoang
, and
Thomas Thierauf
.
Electronic Colloquium on Computational Complexity ECCC
(
2001
)
Thanh Minh Hoang
, and
Thomas Thierauf
.
Electronic Colloquium on Computational Complexity ECCC
(
2001
)
a year and 5 months ago
by
dblp
2
dblp
dblp
URL
DOI
TeX
Reachability in K_3, 3-free Graphs and K_5-free Graphs is in Unambiguous Log-Space.
Fabian Wagner
, and
Thomas Thierauf
.
Electronic Colloquium on Computational Complexity ECCC
(
2009
)
Fabian Wagner
, and
Thomas Thierauf
.
Electronic Colloquium on Computational Complexity ECCC
(
2009
)
a year and 5 months ago
by
dblp
2
dblp
dblp
URL
DOI
TeX
Planarizing Gadgets for Perfect Matching do not Exist.
Rohit Gurjar
,
Arpita Korwar
,
Jochen Messner
,
Simon Straub
, and
Thomas Thierauf
.
Electronic Colloquium on Computational Complexity ECCC
(
2011
)
Rohit Gurjar
,
Arpita Korwar
,
Jochen Messner
,
Simon Straub
, and
Thomas Thierauf
.
Electronic Colloquium on Computational Complexity ECCC
(
2011
)
a year and 5 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Planar Graph Isomorphism is in Log-space.
Fabian Wagner
,
Samir Datta
,
Nutan Limaye
,
Prajakta Nimbhorkar
, and
Thomas Thierauf
.
Electronic Colloquium on Computational Complexity ECCC
(
2009
)
Fabian Wagner
,
Samir Datta
,
Nutan Limaye
,
Prajakta Nimbhorkar
, and
Thomas Thierauf
.
Electronic Colloquium on Computational Complexity ECCC
(
2009
)
a year and 5 months ago
by
dblp
2
dblp
dblp
URL
DOI
TeX
The Satisfiability Problem for Probabilistic Ordered Branching Programs
Manindra Agrawal
, and
Thomas Thierauf
.
Electronic Colloquium on Computational Complexity ECCC
(
1997
)
Manindra Agrawal
, and
Thomas Thierauf
.
Electronic Colloquium on Computational Complexity ECCC
(
1997
)
a year and 5 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
The Isomorphismproblem for One-Time-Only Branching Programs
Thomas Thierauf
.
Electronic Colloquium on Computational Complexity ECCC
(
1996
)
Thomas Thierauf
.
Electronic Colloquium on Computational Complexity ECCC
(
1996
)
a year and 5 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
The Boolean Isomorphism Problem
Manindra Agrawal
, and
Thomas Thierauf
.
Electronic Colloquium on Computational Complexity ECCC
(
1996
)
Manindra Agrawal
, and
Thomas Thierauf
.
Electronic Colloquium on Computational Complexity ECCC
(
1996
)
a year and 5 months ago
by
dblp
2
dblp
dblp
URL
DOI
TeX
BibSonomy is offered by the
KDE group
of the University of Kassel, the
DMIR group
of the University of Würzburg, and the
L3S Research Center
, Germany.
Privacy & Terms of Use
-
Contact