"Generic hardness of the Boolean satisfiability problem."

Alexander N. Rybalov (2017)

> Home

Details and statistics

DOI: 10.1515/GCC-2017-0008

access: closed

type: Journal Article

metadata version: 2020-07-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/gcc/Rybalov17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gcc/Rybalov17
Alexander N. Rybalov:
Generic hardness of the Boolean satisfiability problem. Groups Complex. Cryptol. 9(2): 151-154 (2017)

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.