[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/stacs/DammKMW92>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Carsten_Damm>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Christoph_Meinel>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Matthias_Krause_0001>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Stephan_Waack>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2F3-540-55210-3%5F190>
foaf:homepage <https://doi.org/10.1007/3-540-55210-3_190>
dc:identifier DBLP conf/stacs/DammKMW92 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2F3-540-55210-3%5F190 (xsd:string)
dcterms:issued 1992 (xsd:gYear)
rdfs:label Separating Counting Communication Complexity Classes. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Carsten_Damm>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Christoph_Meinel>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Matthias_Krause_0001>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Stephan_Waack>
swrc:pages 281-292 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/stacs/1992>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/stacs/DammKMW92/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/stacs/DammKMW92>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/stacs/stacs92.html#DammKMW92>
rdfs:seeAlso <https://doi.org/10.1007/3-540-55210-3_190>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/stacs>
dc:subject complexity of Boolean function; communication complexity and distributed computing; probabilism; lower bound arguments; separation of complexity classes (xsd:string)
dc:title Separating Counting Communication Complexity Classes. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document