Average case completeness (Q1176231)

From MaRDI portal

Revision as of 10:11, 15 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Average case completeness	scientific article

Statements

scholarly article

0 references

Average case completeness (English)

0 references

0 references

Journal of Computer and System Sciences

0 references

publication date

25 June 1992

0 references

MaRDI profile type

MaRDI publication profile

0 references

On the Computational Complexity of Program Scheme Equivalence

0 references

0 references

0 references

Expected Computation Time for Hamiltonian Path problem

0 references

0 references

The NP-completeness column: An ongoing guide

0 references

On the definitions of some complexity classes of real numbers

0 references

Average Case Complete Problems

0 references

Complexity results for classes of quantificational formulas

0 references

Average polynomial time complexity of some NP-complete problems

0 references

Some Examples of Combinatorial Averaging

0 references

THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/0022-0000(91)90007-R

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1176231

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1176231&oldid=34078674"