probabilistically
adverb see probabilistic

New Collegiate Dictionary. 2001.

Look at other dictionaries:

  • probabilistically — adverb by the use of probability theory we can calculate the position of the particles probabilistically • Derived from adjective: ↑probabilistic …   Useful english dictionary

  • probabilistically — See probabilistic. * * * …   Universalium

  • probabilistically — adverb In a probabilistic manner; using a method based on probability …   Wiktionary

  • Probabilistically checkable proof — In computational complexity theory, a probabilistically checkable proof (PCP) is a type of proof that can be checked by a randomized algorithm using a bounded amount of randomness and reading a bounded number of bits of the proof. The algorithm… …   Wikipedia

  • probabilistically checkable proof — noun A reasonable proof of a computational theorem or conjecture obtained via a randomized algorithm …   Wiktionary

  • Safety engineering — is an applied science strongly related to systems engineering and the subset System Safety Engineering. Safety engineering assures that a life critical system behaves as needed even when pieces fail.In the real world the term safety engineering… …   Wikipedia

  • Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… …   Wikipedia

  • PCP theorem — In computational complexity theory, the PCP theorem states that every decision problem in the NP complexity class has probabilistically checkable proofs (proofs that can be checked by a randomized algorithm) of constant query complexity and… …   Wikipedia

  • Forward error correction — In telecommunication, information theory, and coding theory, forward error correction (FEC) or channel coding[1] is a technique used for controlling errors in data transmission over unreliable or noisy communication channels. The central idea is… …   Wikipedia

  • NEXPTIME — In computational complexity theory, the complexity class NEXPTIME (sometimes called NEXP) is the set of decision problems that can be solved by a non deterministic Turing machine using time O(2p(n)) for some polynomial p(n), and unlimited space.… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”