Concepedia

William T. Laaser

WT

3

Publications

449

Citations

3

H-Index

1974

Active since

Affiliations

University of Kansas(Current)

William T. Laaser is an author at University of Kansas specializing in computational complexity, engineering, and combinatorial optimization.

Top concepts

EngineeringComputational ComplexityDiscrete MathematicsMathematical ProgrammingCombinatorial OptimizationEntropyFormal MethodsComputer ScienceProof ComplexityAutomated Reasoning

Publications per year

1974–1976

3

Publications

3

Complete problems for deterministic polynomial time

Neil D. Jones, William T. Laaser · Theoretical Computer Science · 1976 · 278 citations

Mathematical Programming, Deterministic System, Computational Complexity Theory +6

New problems complete for nondeterministic log space

Neil D. Jones, Y. Edmund Lien, William T. Laaser · Theory of Computing Systems · 1976 · 131 citations

Computational Complexity Theory, Engineering, Entropy +3

Complete problems for deterministic polynomial time

Neil D. Jones, William T. Laaser · 1974 · 40 citations

Mathematical Programming, Computational Complexity Theory, Engineering +16

Rows per page

1–3 of 3