|
Search the dblp DataBase
Harald Hempel:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
RSN1-tt(NP) Distinguishes Robust Many-One and Turing Completeness. [Citation Graph (0, 0)][DBLP] CIAC, 1997, pp:49-60 [Conf]
- Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen
Algebraic Properties for P-Selectivity. [Citation Graph (0, 0)][DBLP] COCOON, 2001, pp:49-58 [Conf]
- André Große, Harald Hempel
On Functions and Relations. [Citation Graph (0, 0)][DBLP] DMTCS, 2003, pp:181-192 [Conf]
- Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
Query Order in the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP] FCT, 1997, pp:222-232 [Conf]
- Michael Krüger, Harald Hempel
Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete. [Citation Graph (0, 0)][DBLP] ISAAC, 2006, pp:243-252 [Conf]
- Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
All Superlinear Inverse Schemes Are coNP-Hard. [Citation Graph (0, 0)][DBLP] MFCS, 2004, pp:368-379 [Conf]
- Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
A Downward Translation in the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP] STACS, 1997, pp:319-328 [Conf]
- Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1 Queries. [Citation Graph (0, 0)][DBLP] STACS, 1999, pp:269-280 [Conf]
- Harald Hempel, Gerd Wechsung
The Operators min and max on the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP] STACS, 1997, pp:93-104 [Conf]
- Harald Hempel, Dieter Kratsch
On Claw-Free Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP] WG, 1999, pp:377-390 [Conf]
- Lane A. Hemaspaandra, Harald Hempel
P-Immune Sets with Holes Lack Self-Reducibility Properties [Citation Graph (0, 0)][DBLP] CoRR, 2001, v:0, n:, pp:- [Journal]
- Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
Using the No-Search Easy-Hard Technique for Downward Collapse [Citation Graph (0, 0)][DBLP] CoRR, 2001, v:0, n:, pp:- [Journal]
- Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
All Superlinear Inverse Schemes are coNP-Hard [Citation Graph (0, 0)][DBLP] CoRR, 2004, v:0, n:, pp:- [Journal]
- Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
Downward Collapse from a Weaker Hypothesis [Citation Graph (0, 0)][DBLP] CoRR, 1998, v:0, n:, pp:- [Journal]
- Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
Query Order [Citation Graph (0, 0)][DBLP] CoRR, 1999, v:0, n:, pp:- [Journal]
- Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
What's Up with Downward Collapse: Using the Easy-Hard Technique to Link Boolean and Polynomial Hierarchy Collapses [Citation Graph (0, 0)][DBLP] CoRR, 1999, v:0, n:, pp:- [Journal]
- Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
R1-ttSN(NP) Distinguishes Robust Many-One and Turing Completeness [Citation Graph (0, 0)][DBLP] CoRR, 1999, v:0, n:, pp:- [Journal]
- Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
An Introduction to Query Order [Citation Graph (0, 0)][DBLP] CoRR, 1999, v:0, n:, pp:- [Journal]
- Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
Query Order and the Polynomial Hierarchy [Citation Graph (0, 0)][DBLP] CoRR, 1999, v:0, n:, pp:- [Journal]
- Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
Self-Specifying Machines [Citation Graph (0, 0)][DBLP] CoRR, 1999, v:0, n:, pp:- [Journal]
- Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
A Downward Collapse within the Polynomial Hierarchy [Citation Graph (0, 0)][DBLP] CoRR, 1999, v:0, n:, pp:- [Journal]
- Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
Translating Equality Downwards [Citation Graph (0, 0)][DBLP] CoRR, 1999, v:0, n:, pp:- [Journal]
- Harald Hempel, Dieter Kratsch
On claw-free asteroidal triple-free graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:121, n:1-3, pp:155-180 [Journal]
- Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
An Introduction to Query Order. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1997, v:63, n:, pp:- [Journal]
- Harald Hempel, Gerd Wechsung
The Operators min and max on the Polynomial Hierarchy [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:25, pp:- [Journal]
- Richard Beigel, Lane A. Hemaspaandra, Harald Hempel, Jörg Vogel
Optimal Series-Parallel Trade-offs for Reducing a Function to Its Own Graph. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2002, v:173, n:2, pp:123-131 [Journal]
- Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
Self-Specifying Machines. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 1999, v:10, n:3, pp:263-276 [Journal]
- Harald Hempel, Gerd Wechsung
The Operators min and max on the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2000, v:11, n:2, pp:315-342 [Journal]
- Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
Query Order and the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP] J. UCS, 1998, v:4, n:6, pp:574-588 [Journal]
- Harald Hempel
Randomized Algorithms and Complexity Theory. [Citation Graph (0, 0)][DBLP] J. UCS, 2006, v:12, n:6, pp:746-761 [Journal]
- Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
RS N1-tt (NP) Distinguishes Robust Many-One and Turing Completeness. [Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 1998, v:31, n:3, pp:307-325 [Journal]
- Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
A Downward Collapse within the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:28, n:2, pp:383-393 [Journal]
- Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen
Algebraic Properties for Selector Functions. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2004, v:33, n:6, pp:1309-1337 [Journal]
- Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
Query Order. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:28, n:2, pp:637-651 [Journal]
- Lane A. Hemaspaandra, Harald Hempel
P-immune sets with holes lack self-reducibility properties. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:302, n:1-3, pp:457-466 [Journal]
- Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
All superlinear inverse schemes are coNP-hard. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:345, n:2-3, pp:345-358 [Journal]
- Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen
Algebraic Properties for Selector Functions [Citation Graph (0, 0)][DBLP] CoRR, 2005, v:0, n:, pp:- [Journal]
Approximating Alternative Solutions. [Citation Graph (, )][DBLP]
Inverse Problems Have Inverse Complexity. [Citation Graph (, )][DBLP]
Persistent Computations of Turing Machines. [Citation Graph (, )][DBLP]
Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights. [Citation Graph (, )][DBLP]
Search in 0.007secs, Finished in 0.010secs
|