I would break it into two problems.
1. Is the point inside the bounding sphere of the polyhedron, this is a pretty common hit test and will give you very good results. Typically this would be sufficient for any kind of simulation or game since the accuracy of the hit test actually increases with the number of sides.
2. If you really need to know if the point itself then you need to treat it as any other polygon. Typically this involves casting a ray in any direction and counting the number of intersections. If the point is inside the polygon it will only intersect once (regular polyhedrons are not concave), and if its outside it will intersect zero or twice. If the polyhedron is of a type that is concave (like Star Polyhedrons) then this becomes much harder to determine.
If you search google for "Point in Polyhedron" it will give you a number of articles, and things like
this StackOverflow answer[
^] that may give you what you need.