-
Larry Joseph Stockmeyer (1948 – 31 July 2004) was an
American computer scientist. He was one of the
pioneers in the
field of com****tional
complexity theory...
- For
other variants of the four-peg
Tower of
Hanoi problem, see Paul
Stockmeyer's survey paper. The so-called
Towers of
Bucharest and
Towers of Klagenfurt...
- p399 Hopcroft,
Ullman (1979),
Theorem 13.15, p.351 A.R.
Meyer & L.J.
Stockmeyer (Oct 1972). The
Equivalence Problem for
Regular Expressions with Squaring...
- accept. The
model was
introduced by Chandra,
Kozen and
Stockmeyer. Ladner,
Lipton and
Stockmeyer proved that this
model is
equivalent to
EXPTIME i.e. a...
- \mathbb {N} }\Delta _{k}^{\mathrm {P} }} PH was
first defined by
Larry Stockmeyer. It is a
special case of
hierarchy of
bounded alternating Turing machine...
-
Turing machines in com****tional
complexity (with
Dexter Kozen and
Larry Stockmeyer),
conjunctive queries in
databases (with
Philip M. Merlin), com****ble...
- the input. This
appears to have been
first demonstrated in Gurevich,
Stockmeyer &
Vishkin (1984). The
first systematic work on
parameterized complexity...
- 1991. He
retired from MIT in 2016. Meyer's
seminal works include Meyer &
Stockmeyer (1972),
which introduced the
polynomial hierarchy. He has
supervised numerous...
-
classes NP and co-NP. The
concept of an ATM was set
forth by
Chandra and
Stockmeyer and
independently by
Kozen in 1976, with a
joint journal publication in...
-
Dominating set
Gallai 1959.
Vazirani 2003, pp. 121–122 Garey,
Johnson &
Stockmeyer 1974
Garey &
Johnson 1977;
Garey &
Johnson 1979, pp. 190 and 195. Chen...
