<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>teorema PCP Archives - MultiMedia</title>
	<atom:link href="https://www.telework.ro/ro/tag/teorema-pcp/feed/" rel="self" type="application/rss+xml" />
	<link>https://www.telework.ro/ro/tag/teorema-pcp/</link>
	<description>Știință și filosofie, afaceri online (web design, marketing, traduceri, cărți online, rețele sociale), artă. Știința informației (data science, business intelligence).</description>
	<lastBuildDate>Tue, 28 Jul 2026 18:20:55 +0000</lastBuildDate>
	<language>ro-RO</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	

<image>
	<url>https://www.telework.ro/wp-content/uploads/2016/01/cropped-logostore-32x32.png</url>
	<title>teorema PCP Archives - MultiMedia</title>
	<link>https://www.telework.ro/ro/tag/teorema-pcp/</link>
	<width>32</width>
	<height>32</height>
</image> 
<site xmlns="com-wordpress:feed-additions:1">2257885</site>	<item>
		<title>Teorema PCP (Probabilistically checkable proof &#8211; Dovada verificabilă probabilistic)</title>
		<link>https://www.telework.ro/ro/teorema-pcp-probabilistically-checkable-proof-dovada-verificabila-probabilistic/</link>
					<comments>https://www.telework.ro/ro/teorema-pcp-probabilistically-checkable-proof-dovada-verificabila-probabilistic/#respond</comments>
		
		<dc:creator><![CDATA[Nicolae Sfetcu]]></dc:creator>
		<pubDate>Tue, 28 Jul 2026 18:20:55 +0000</pubDate>
				<category><![CDATA[Matematica]]></category>
		<category><![CDATA[dovada verificabilă probabilistic]]></category>
		<category><![CDATA[teorema PCP]]></category>
		<guid isPermaLink="false">https://www.telework.ro/?p=126528</guid>

					<description><![CDATA[<p>Teorema PCP, numită și teorema caracterizării PCP, este unul dintre rezultatele fundamentale ale teoriei complexității computaționale. Inițialele PCP provin din expresia engleză Probabilistically Checkable Proof, adică „dovadă verificabilă probabilistic”. Ideea centrală este surprinzătoare: orice problemă din clasa de complexitate NP &#8230; <a class="kt-excerpt-readmore" href="https://www.telework.ro/ro/teorema-pcp-probabilistically-checkable-proof-dovada-verificabila-probabilistic/" aria-label="Teorema PCP (Probabilistically checkable proof &#8211; Dovada verificabilă probabilistic)">Citeşte mai mult</a></p>
<p>The post <a href="https://www.telework.ro/ro/teorema-pcp-probabilistically-checkable-proof-dovada-verificabila-probabilistic/">Teorema PCP (Probabilistically checkable proof &#8211; Dovada verificabilă probabilistic)</a> appeared first on <a href="https://www.telework.ro/ro">MultiMedia</a>.</p>
]]></description>
		
					<wfw:commentRss>https://www.telework.ro/ro/teorema-pcp-probabilistically-checkable-proof-dovada-verificabila-probabilistic/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">126528</post-id>	</item>
	</channel>
</rss>
