(Q61661700)

English

The matching problem for bipartite graphs with polynomially bounded permanents is in NC

No description defined

In more languages

default for all languages

No label defined

No description defined

Statements

scholarly article

0 references

The matching problem for bipartite graphs with polynomially bounded permanents is in NC (English)

0 references

author name string

Dima Yu. Grigoriev

1

0 references

Marek Karpinski

2

0 references

Institute of Electrical and Electronics Engineers

0 references

publication date

October 1987

0 references

language of work or name

0 references

Identifiers

10.1109/SFCS.1987.56

0 references

Sitelinks

Wikipedia(0 entries)

Wikibooks(0 entries)

Wikinews(0 entries)

Wikiquote(0 entries)

Wikisource(0 entries)

Wikiversity(0 entries)

Wikivoyage(0 entries)

Wiktionary(0 entries)

Multilingual sites(0 entries)

Retrieved from "https://www.wikidata.org/w/index.php?title=Q61661700&oldid=2391825212"