<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.upr.si/IzpisGradiva.php?id=7716"><dc:title>Bar´ery Gibsona dlja problemy Polia</dc:title><dc:creator>Dolinar,	Gregor	(Avtor)
	</dc:creator><dc:creator>Guterman,	Aleksandr Èmilevič	(Avtor)
	</dc:creator><dc:creator>Kuzma,	Bojan	(Avtor)
	</dc:creator><dc:subject>matematika</dc:subject><dc:subject>linearna algebra</dc:subject><dc:subject>teorija matrik</dc:subject><dc:subject>permanenta</dc:subject><dc:subject>determinanta</dc:subject><dc:subject/><dc:description>V članku je obravnavana spodnja meja za število neničelnih elementov v ▫$(0, 1)$▫ matrikah, pri katerem se da permanento vedno pretvoriti v determinanto samo s spreminjanjem predznaka ▫$pm$▫ elementom matrike.</dc:description><dc:date>2010</dc:date><dc:date>2016-04-08 16:42:10</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>7716</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>