Harald Hempel

47 papers A 3B 4C 3Misc 2Journal 31Unranked 3
YearRankTypeTitle / Venue / Authors
2012 J jnl
Inverse Hamiltonian Cycle and inverse 3Dimensional Matching are coNP-complete.
Theor. Comput. Sci.
Harald Hempel, Michael Krüger
2009 J jnl
Aspects of Persistent Computations.
Int. J. Found. Comput. Sci.
Harald Hempel, Madlen Kimmritz
2009 C conf
Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights.
LATA
Tobias Berg, Harald Hempel
2008 Misc conf
Approximating Alternative Solutions.
COCOON
Michael Krüger, Harald Hempel
2008 — conf
Inverse Problems Have Inverse Complexity.
IFIP TCS
Tobias Berg, Harald Hempel
2008 C conf
Persistent Computations of Turing Machines.
CIAA
Harald Hempel, Madlen Kimmritz
2006 B conf
Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete.
ISAAC
Michael Krüger, Harald Hempel
2006 J jnl
Randomized Algorithms and Complexity Theory.
J. Univers. Comput. Sci.
Harald Hempel
2005 J jnl
Algebraic Properties for Selector Functions
CoRR
Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen
2005 J jnl
All superlinear inverse schemes are coNP-hard.
Theor. Comput. Sci.
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
2005 J jnl
Extending Downward Collapse from 1-versus-2 Queries to m-versus-m + 1 Queries.
SIAM J. Comput.
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
2004 J jnl
Algebraic Properties for Selector Functions.
SIAM J. Comput.
Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen
2004 B conf
All Superlinear Inverse Schemes Are coNP-Hard.
MFCS
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
2004 J jnl
All Superlinear Inverse Schemes are coNP-Hard
CoRR
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
2003 — conf
On Functions and Relations.
DMTCS
André Große, Harald Hempel
2003 J jnl
P-immune sets with holes lack self-reducibility properties.
Theor. Comput. Sci.
Lane A. Hemaspaandra, Harald Hempel
2002 J jnl
On claw-free asteroidal triple-free graphs.
Discret. Appl. Math.
Harald Hempel, Dieter Kratsch
2002 J jnl
Optimal Series-Parallel Trade-offs for Reducing a Function to Its Own Graph.
Inf. Comput.
Richard Beigel, Lane A. Hemaspaandra, Harald Hempel, Jörg Vogel
2001 Misc conf
Algebraic Properties for P-Selectivity.
COCOON
Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen
2001 J jnl
P-Immune Sets with Holes Lack Self-Reducibility Properties
CoRR
Lane A. Hemaspaandra, Harald Hempel
2001 — conf
P-Immune Sets with Holes Lack Self-Reducibility Properties.
DMTCS
Lane A. Hemaspaandra, Harald Hempel
2001 J jnl
Using the No-Search Easy-Hard Technique for Downward Collapse
CoRR
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
2000 J jnl
The Operators min and max on the Polynomial Hierarchy.
Int. J. Found. Comput. Sci.
Harald Hempel, Gerd Wechsung
1999 J jnl
A Downward Collapse within the Polynomial Hierarchy
CoRR
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1999 J jnl
An Introduction to Query Order
CoRR
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1999 A conf
Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1 Queries.
STACS
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1999 B conf
On Claw-Free Asteroidal Triple-Free Graphs.
WG
Harald Hempel, Dieter Kratsch
1999 J jnl
Query Order
CoRR
Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
1999 J jnl
Query Order and the Polynomial Hierarchy
CoRR
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1999 J jnl
R
CoRR
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1999 J jnl
Self-Specifying Machines
CoRR
Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
1999 J jnl
Self-Specifying Machines.
Int. J. Found. Comput. Sci.
Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
1999 J jnl
Translating Equality Downwards
CoRR
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1999 J jnl
What's Up with Downward Collapse: Using the Easy-Hard Technique to Link Boolean and Polynomial Hierarchy Collapses
CoRR
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1998 J jnl
A Downward Collapse within the Polynomial Hierarchy.
SIAM J. Comput.
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1998 — —
Boolean hierarchies - on collapse properties and query order.
Harald Hempel
1998 J jnl
Downward Collapse from a Weaker Hypothesis
CoRR
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1998 J jnl
Query Order and the Polynomial Hierarchy.
J. Univers. Comput. Sci.
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1998 J jnl
Query Order.
SIAM J. Comput.
Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
1998 J jnl
R
Theory Comput. Syst.
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1998 J jnl
What's up with downward collapse: using the easy-hard technique to link Boolean and polynomial hierarchy collapses.
SIGACT News
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1997 A conf
A Downward Translation in the Polynomial Hierarchy.
STACS
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1997 J jnl
An Introduction to Query Order.
Bull. EATCS
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1997 B conf
Query Order in the Polynomial Hierarchy.
FCT
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1997 C conf
R
CIAC
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1997 J jnl
The Operators min and max on the Polynomial Hierarchy
Electron. Colloquium Comput. Complex.
Harald Hempel, Gerd Wechsung
1997 A conf
The Operators min and max on the Polynomial Hierarchy.
STACS
Harald Hempel, Gerd Wechsung