Circuit Complexity of Bounded Planar Cutwidth Graph Matching.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/corr/abs-1801-00906
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/corr/abs-1801-00906
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Aayush_Ojha
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Raghunath_Tewari
>
foaf:
homepage
<
http://arxiv.org/abs/1801.00906
>
dc:
identifier
DBLP journals/corr/abs-1801-00906
(xsd:string)
dcterms:
issued
2018
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/corr
>
rdfs:
label
Circuit Complexity of Bounded Planar Cutwidth Graph Matching.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Aayush_Ojha
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Raghunath_Tewari
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/corr/abs-1801-00906/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/corr/abs-1801-00906
>
rdfs:
seeAlso
<
http://arxiv.org/abs/1801.00906
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/corr/corr1801.html#abs-1801-00906
>
dc:
title
Circuit Complexity of Bounded Planar Cutwidth Graph Matching.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
abs/1801.00906
(xsd:string)