Computational Complexity, Efficiency and Accountability in Large Scale Teleprocessing Systems.

Abstract

Research is summarized in the following areas: certified digital signals, factoring and random graphs, compact knapsacks, NP-complete problems, and indices in a finite field GF(q to the m power). (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1980
Accession Number
ADA093732

Entities

People

  • John T. Gill
  • Martin E. Hellman

Organizations

  • Stanford University

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Accountability
  • Algorithms
  • Binary Arithmetic
  • Communication Systems
  • Computational Complexity
  • Computations
  • Computer Programs
  • Computers
  • Efficiency
  • Graph Theory
  • Numbers
  • Square Roots
  • Theory Of Computation

Readers

  • Computer Science/Computer Engineering/Data Science/Digital Signal Processing.
  • Defense Acquisition Program Management
  • Graph Algorithms and Convex Optimization.