<--- Back to Details
First PageDocument Content
Neurochemistry / Probabilistic complexity theory / Computer-aided design / Data modeling / Infrastructure / Real estate / Phencyclidine / Rijkswaterstaat / Probabilistically checkable proof / Construction / Architecture / Building information modeling
Date: 2014-04-05 02:57:38
Neurochemistry
Probabilistic complexity theory
Computer-aided design
Data modeling
Infrastructure
Real estate
Phencyclidine
Rijkswaterstaat
Probabilistically checkable proof
Construction
Architecture
Building information modeling

Microsoft Word - V-Con_Factsheet_final.doc

Add to Reading List

Source URL: www.rijkswaterstaat.nl

Download Document from Source Website

File Size: 220,73 KB

Share Document on Facebook

Similar Documents

Theoretical computer science / Lance Fortnow / Probabilistic complexity theory / Carsten Lund / Computer science / IP / BPP / Probabilistically checkable proof / Symposium on Foundations of Computer Science / Mathematics

Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing.

DocID: 1rgOi - View Document

Neurochemistry / Nervous system / Probabilistic complexity theory / General anesthetics / Piperidines / Biochemistry / Probabilistically checkable proof / Phencyclidine

SelectNet_Manual_v2_April_2012.pdf

DocID: 1qMoc - View Document

Health care / Neurochemistry / Health / Dissociative drugs / NMDA receptor antagonists / Piperidines / Family medicine / Phencyclidine / Primary care physician / Probabilistically checkable proof

WV Public Employees Insurance Agency Frequently Asked Questions on Picking a Primary Care Provider Q. Why is PEIA making me pick a physician?

DocID: 1qjEP - View Document

Lance Fortnow / Probabilistic complexity theory / BPP / Probabilistically checkable proof / Carsten Lund / Computational complexity theory

Interactive proofs April 12, L´ aszl´ o Babai. Trading group theory for randomness. In Proc. 17th STOC, pages 421–429. ACM Press, 1985. doi:22192.

DocID: 1oP1q - View Document

Computational complexity theory / Theory of computation / Complexity classes / NP-complete problems / Mathematical optimization / NP-hard problems / MAX-3SAT / NP / Approximation algorithm / Probabilistically checkable proof / PCP theorem / APX

Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004

DocID: 1mroB - View Document