Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"An O(n²) Algorithm for the Satisfiability Problem of a Subset of ..."

Vikraman Arvind, Somenath Biswas (1987)

> Home

Details and statistics

DOI: 10.1016/0020-0190(87)90200-6

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/ArvindB87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/ArvindB87
Vikraman Arvind, Somenath Biswas:
An O(n²) Algorithm for the Satisfiability Problem of a Subset of Propositional Sentences in CNF That Includes All Horn Sentences. Inf. Process. Lett. 24(1): 67-69 (1987)

a service of

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.