SIGACT news complexity theory column 36

@article{Hemaspaandra2002SIGACTNC,
  title={SIGACT news complexity theory column 36},
  author={Lane A. Hemaspaandra},
  journal={SIGACT News},
  year={2002},
  volume={33},
  pages={34-47}
}
This current issue's guest column is by Bill Gasarch, and reports on a poll he has conducted on the most famous open question in complexity theory: P=?NP. If Mitsunori Ogihara's prediction that P-vs-NP will not be resolved until the year 3000 is correct, my guess is more than a few students of the history of computer theory will be visiting, long after all the contributors are gone, Bill's column, which will provide a time capsule into the thoughts of many in the field. Who knows? Perhaps there… 

Open Problems Column

This column contains my answers about the status of P vs NP, as well as comments on other people's answers.

Rewriting methods in higher algebra

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and

Some Estimated Likelihoods for Computational Complexity

The editors of this LNCS volume asked me to speculate on open problems: out of the prominent conjectures in computational complexity, which of them might be true, and why?

Open Problems Column

This column contains my answers about the status of P vs NP, as well as comments on other people's answers.

P\mathop{ =}\limits^{?}NP

In 1950, John Nash sent a remarkable letter to the National Security Agency, in which—seeking to build theoretical foundations for cryptography—he all but formulated what today we call the

Analysis of Algorithms and Partial Algorithms

This methodology naturally handles algorithms that do not always terminate, so it can (theoretically) be used with partial algorithms for undecidable problems, such as those found in artificial general intelligence (AGI) and automated theorem proving.

Understanding SAT is in P

A mechanical process is presented that obtains an understanding with respect to a 3-SAT problem instance based on the contexts of each literal in the instance, otherwise it determines that none exists.

Classifying Problems into Complexity Classes

Computing equilibria: a computational complexity perspective

  • T. Roughgarden
  • Computer Science
    Electron. Colloquium Comput. Complex.
  • 2015
This survey explains how complexity theory defines “hard problems”; applies these concepts to several equilibrium computation problems; and discusses implications for computation, games, and behavior.

On the use of convex underestimators in global optimization

Manga kvantitativa problem fran vitt skilda omraden kan beskrivas som optimeringsproblem. Ett matt pa losningens kvalitet bor optimeras samtidigt som vissa villkor pa losningen uppfylls.

References

2 sighted reasons of sociology of research as to why the problem remains unsolved—the tenure system in America being a problem, and the globalization leading to uniformity of thought

  • 2 sighted reasons of sociology of research as to why the problem remains unsolved—the tenure system in America being a problem, and the globalization leading to uniformity of thought