Results 321 to 330 of about 5,239,116 (369)
Some of the next articles are maybe not open access.
Computability, Complexity and Economics
Computational Economics, 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Bridging the complexity gap in computational heterogeneous catalysis with machine learning
Nature Catalysis, 2023Tianyou Mou +7 more
semanticscholar +1 more source
The Knowledge Complexity of Interactive Proof Systems
SIAM journal on computing (Print), 1989Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the ...
S. Goldwasser, S. Micali, C. Rackoff
semanticscholar +1 more source
Managing computational complexity using surrogate models: a critical review
Research in Engineering Design, 2020R. Alizadeh, J. Allen, F. Mistree
semanticscholar +1 more source
Theoretical Computer Science: Computational Complexity
2020How much time, space and/or hardware resource does require an algorithm? Such questions lead to surprising results: conceptual simplicity does not always go along with efficiency. A lot of quite natural questions remain open, e.g., the famous P \(=\) NP problem raised in 1970.
Bournez, Olivier +6 more
openaire +4 more sources
Proceedings of the 1978 annual conference on - ACM 78, 1978
Construction of algorithms is a time honored mathematical activity. Euclid's algorithm for finding the greatest common divisor of two integers, as well as the many constructions by a ruler and compass are some of the fruits of the search for algorithms by the Greek mathematicians.
openaire +1 more source
Construction of algorithms is a time honored mathematical activity. Euclid's algorithm for finding the greatest common divisor of two integers, as well as the many constructions by a ruler and compass are some of the fruits of the search for algorithms by the Greek mathematicians.
openaire +1 more source
2001
Once we have the building blocks for a computing device, we can construct the device and give it tasks to perform. Some tasks are more difficult than others. Some tasks may even be impossible for the computing device to perform. This is the concept of computability.
Willi-Hans Steeb, Yorick Hardy
openaire +2 more sources
Once we have the building blocks for a computing device, we can construct the device and give it tasks to perform. Some tasks are more difficult than others. Some tasks may even be impossible for the computing device to perform. This is the concept of computability.
Willi-Hans Steeb, Yorick Hardy
openaire +2 more sources
Complexity of Computer Computations
Mathematics of Computation, 1972Jean D. Bohlinger +2 more
openaire +2 more sources
Due Date-Related Scheduling with Two Agents, 2020
Yunqiang Yin, Dujuan Wang, T. Cheng
semanticscholar +1 more source
Yunqiang Yin, Dujuan Wang, T. Cheng
semanticscholar +1 more source
Kolmogorov Complexity and Computational Complexity
1992There are many ways to measure the complexity of a given object, but there are two measures of particular importance in the theory of computing: One is Kolmogorov complexity, which measures the amount of information necessary to describe an object. Another is computational complexity, which measures the computational resources necessary to recognize ...
openaire +2 more sources