"Equivalence of Free Boolean Graphs can be Decided Probabilistically in ..."

Manuel Blum, Ashok K. Chandra, Mark N. Wegman (1980)

> Home

Details and statistics

DOI: 10.1016/S0020-0190(80)90078-2

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/BlumCW80
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/BlumCW80
Manuel Blum, Ashok K. Chandra, Mark N. Wegman:
Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time. Inf. Process. Lett. 10(2): 80-82 (1980)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.