On digital nondeterminism (Q4717055)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 951910

Language	Label	Description	Also known as
English	On digital nondeterminism	scientific article; zbMATH DE number 951910

Statements

scholarly article

0 references

On digital nondeterminism (English)

0 references

0 references

Martin Matamala

0 references

Mathematical Systems Theory

0 references

publication date

17 August 1997

0 references

zbMATH Keywords

Boolean satisfiability

0 references

MaRDI profile type

MaRDI publication profile

0 references

Disordered Systems and Biological Organization

0 references

On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

0 references

\(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\)

0 references

On the Complexity of Quantifier Elimination: the Structural Approach

0 references

Two \(P\)-complete problems in the theory of the reals

0 references

On the complexity of computations under varying sets of primitives

0 references

Accessible telephone directories

0 references

Neural networks and physical systems with emergent collective computational abilities.

0 references

``Neural'' computation of decisions in optimization problems

0 references

Complete problems for deterministic polynomial time

0 references

Bounds for the computational power and learning complexity of analog neural nets

0 references

A note on a \(P \neq NP\) result for a restricted class of real machines

0 references

0 references

Analog computation via neural networks

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/BF01301968

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4717055

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