Name
Abstract | ||
|---|---|---|
We investigate the complexity of the decision problem for subclasses of the intuitionistic propositional calculus and present upper bounds for decision procedures locating these subclasses into lower complexity classes like co-NP or polynomial time. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1007/BF01995108 | BIT |
Keywords | Field | DocType |
upper bound,decision problem,polynomial time,complexity class | Complexity class,Discrete mathematics,Decision problem,Mathematical optimization,Structural complexity theory,Algebra,Propositional calculus,UP,Time complexity,Mathematics | Journal |
Volume | Issue | ISSN |
32 | 1 | 1572-9125 |
Citations | PageRank | References |
3 | 0.50 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Grigori Mints | 1 | 235 | 72.76 |