-
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...
-
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...
-
square matrix, in
which he
proved that
permanent is #P-complete.
Larry Stockmeyer has
proved that for
every #P
problem P {\displaystyle P}
there exists...
- {\displaystyle A_{w}(q_{0})=1} . This
model was
introduced by Chandra,
Kozen and
Stockmeyer. Even
though AFA can
accept exactly the
regular languages, they are different...
- \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...
- the input. This
appears to have been
first demonstrated in Gurevich,
Stockmeyer &
Vishkin (1984). The
first systematic work on
parameterized complexity...
- non-reconstructible
digraphs are known,
including tournaments (
Stockmeyer) and non-tournaments (
Stockmeyer). A
tournament is
reconstructible if it is not strongly...
-
Leubsdorf married twice. His
first wife was
Carolyn (née Cleveland)
Stockmeyer, a
widowed mother of four
children who
served as the
finance communications...
- 1991. He
retired from MIT in 2016. Meyer's
seminal works include Meyer &
Stockmeyer (1972),
which introduced the
polynomial hierarchy. He has
supervised numerous...
- 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...
