×

zbMATH — the first resource for mathematics

Hempel, Harald

Compute Distance To:
Author ID: hempel.harald Recent zbMATH articles by "Hempel, Harald"
Published as: Hempel, H.; Hempel, Harald
Documents Indexed: 25 Publications since 1997

Publications by Year

Citations contained in zbMATH

19 Publications have been cited 58 times in 46 Documents Cited by Year
A downward collapse within the polynomial hierarchy. Zbl 0915.68070
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Hempel, Harald
10
1998
On claw-free asteroidal triple-free graphs. Zbl 1002.68109
Hempel, Harald; Kratsch, Dieter
7
2002
Query order. Zbl 0915.68071
Hemaspaandra, Lane A.; Hempel, Harald; Wechsung, Gerd
7
1998
Reoptimization of traveling salesperson problems: Changing single edge-weights. Zbl 1234.90015
Berg, Tobias; Hempel, Harald
6
2009
The operators min and max on the polynomial hierarchy. Zbl 1319.68095
Hempel, Harald; Wechsung, Gerd
4
2000
Query order and the polynomial hierarchy. Zbl 0961.68052
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Hempel, Harald
4
1998
An introduction to query order. Zbl 0889.68061
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Hempel, Harald
4
1997
On claw-free asteroidal triple-free graphs. Zbl 0941.05060
Hempel, Harald; Kratsch, Dieter
3
1999
P-immune sets with holes lack self-reducibility properties. Zbl 1044.68068
Hemaspaandra, Lane A.; Hempel, Harald
2
2003
Extending downward collapse from 1-versus-2 queries to \(j\)-versus-\(j+1\) queries. Zbl 0936.68048
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Hempel, Harald
2
1999
Persistent computations of Turing machines. Zbl 1172.68472
Hempel, Harald; Kimmritz, Madlen
1
2008
Inverse Hamiltonian Cycle and Inverse 3-D Matching are coNP-complete. Zbl 1135.68430
Krüger, Michael; Hempel, Harald
1
2006
All superlinear inverse schemes are coNP-hard. Zbl 1079.68041
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Hempel, Harald
1
2005
Extending downward collapse from 1-versus-2 queries to \(m\)-versus-\(m + 1\) queries. Zbl 1082.68035
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Hempel, Harald
1
2005
All superlinear inverse schemes are coNP-hard. Zbl 1096.68064
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Hempel, Harald
1
2004
Algebraic properties for selector functions. Zbl 1101.68596
Hemaspaandra, Lane A.; Hempel, Harald; Nickelsen, Arfst
1
2004
On functions and relations. Zbl 1040.68044
Große, André; Hempel, Harald
1
2003
Self-specifying machines. Zbl 1319.68083
Hemaspaandra, Lane A.; Hempel, Harald; Wechsung, Gerd
1
1999
\(R_{1-tt}^{{\mathcal SN}}\)(NP) distinguishes robust many-one and Turing completeness. Zbl 0896.68060
Hemaspaandra, E.; Hemaspaandra, L. A.; Hempel, H.
1
1998
Reoptimization of traveling salesperson problems: Changing single edge-weights. Zbl 1234.90015
Berg, Tobias; Hempel, Harald
6
2009
Persistent computations of Turing machines. Zbl 1172.68472
Hempel, Harald; Kimmritz, Madlen
1
2008
Inverse Hamiltonian Cycle and Inverse 3-D Matching are coNP-complete. Zbl 1135.68430
Krüger, Michael; Hempel, Harald
1
2006
All superlinear inverse schemes are coNP-hard. Zbl 1079.68041
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Hempel, Harald
1
2005
Extending downward collapse from 1-versus-2 queries to \(m\)-versus-\(m + 1\) queries. Zbl 1082.68035
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Hempel, Harald
1
2005
All superlinear inverse schemes are coNP-hard. Zbl 1096.68064
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Hempel, Harald
1
2004
Algebraic properties for selector functions. Zbl 1101.68596
Hemaspaandra, Lane A.; Hempel, Harald; Nickelsen, Arfst
1
2004
P-immune sets with holes lack self-reducibility properties. Zbl 1044.68068
Hemaspaandra, Lane A.; Hempel, Harald
2
2003
On functions and relations. Zbl 1040.68044
Große, André; Hempel, Harald
1
2003
On claw-free asteroidal triple-free graphs. Zbl 1002.68109
Hempel, Harald; Kratsch, Dieter
7
2002
The operators min and max on the polynomial hierarchy. Zbl 1319.68095
Hempel, Harald; Wechsung, Gerd
4
2000
On claw-free asteroidal triple-free graphs. Zbl 0941.05060
Hempel, Harald; Kratsch, Dieter
3
1999
Extending downward collapse from 1-versus-2 queries to \(j\)-versus-\(j+1\) queries. Zbl 0936.68048
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Hempel, Harald
2
1999
Self-specifying machines. Zbl 1319.68083
Hemaspaandra, Lane A.; Hempel, Harald; Wechsung, Gerd
1
1999
A downward collapse within the polynomial hierarchy. Zbl 0915.68070
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Hempel, Harald
10
1998
Query order. Zbl 0915.68071
Hemaspaandra, Lane A.; Hempel, Harald; Wechsung, Gerd
7
1998
Query order and the polynomial hierarchy. Zbl 0961.68052
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Hempel, Harald
4
1998
\(R_{1-tt}^{{\mathcal SN}}\)(NP) distinguishes robust many-one and Turing completeness. Zbl 0896.68060
Hemaspaandra, E.; Hemaspaandra, L. A.; Hempel, H.
1
1998
An introduction to query order. Zbl 0889.68061
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Hempel, Harald
4
1997

Citations by Year