Bazsites.com Workweek Reduction
Directory Topics
On the Web
- Productivity and the Workweek - Uses statistics to argue that increasing productivity makes dramatic reductions in the workweek possible.
- Shorter Work Time - Information on the campaign to increase free time.
- WorkOptions.com - How to get an employer to agree to telecommuting, part-time, job sharing or other flexible work arrangements. Proven, practical help on developing a written proposal.
Wikipedia Articles
- Truth table reduction - In computability theory, a truth table reduction is a reduction from one set of natural numbers to another. Truth table reductions are less powerful than Turing reductions, since not every Turing reduction between sets can be performed by a truth table reduction, but every truth table reduction can be performed by a Turing reduction.
- Polynomial-time reduction - In computational complexity theory a polynomial-time reduction is a reduction which is computable by a deterministic Turing machine in polynomial time. If it is a many-one reduction, it is called a polynomial-time many-one reduction, polynomial transformation, or Karp reduction.
- First-order reduction - In computational complexity theory, a first-order reduction is a very weak type of reduction between two computational problems. A first-order reduction is a reduction where each component is restricted to be in the class FO of problems calculable in first-order logic.
- Dynamic Noise Reduction - Dynamic Noise Reduction (DNR) is an audio noise reduction system, introduced by National Semiconductor to reduce noise levels on long-distance telephony.First sold in 1981, DNR is frequently confused with the far more common Dolby noise reduction system].
- Turing reduction - In computability theory, a Turing reduction from a problem A to a problem B, named after Alan Turing, is a reduction which solves A, assuming B is already known (Rogers 1967, Soare 1987). More formally, a Turing reduction is a function computable by an oracle machine with an oracle for B.