Ads
related to: computer problems freeantivirussoftwareguide.com has been visited by 100K+ users in the past month
wiki-drivers.com has been visited by 100K+ users in the past month
Search results
Results From The WOW.Com Content Network
(This is problem #9 in Smale's list of problems.) How many queries are required for envy-free cake-cutting? What is the algorithmic complexity of the minimum spanning tree problem? Equivalently, what is the decision tree complexity of the MST problem?
For functions in certain classes, the problem of determining: whether two functions are equal, known as the zero-equivalence problem (see Richardson's theorem); [5] the zeroes of a function; whether the indefinite integral of a function is also in the class. [6] Of course, some subclasses of these problems are decidable.
The problem for graphs is NP-complete if the edge lengths are assumed integers. The problem for points on the plane is NP-complete with the discretized Euclidean metric and rectilinear metric. The problem is known to be NP-hard with the (non-discretized) Euclidean metric. [3]: ND22, ND23
The year 2038 problem (also known as Y2038, [1] Y2K38, Y2K38 superbug or the Epochalypse [2] [3]) is a time computing problem that leaves some computer systems unable to represent times after 03:14:07 UTC on 19 January 2038.
Pages in category "Unsolved problems in computer science" The following 33 pages are in this category, out of 33 total. This list may not reflect recent changes .
System Mechanic is an easy solution for optimal PC performance and simple computing. Once downloaded, it helps speed up slow computers by removing unnecessary software and files and fixes problems ...
Ads
related to: computer problems freeantivirussoftwareguide.com has been visited by 100K+ users in the past month