Capturing Polynomial Time using Modular Decomposition
The question of whether there is a logic that captures polynomial time is one of the main open problems in descriptive complexity theory and database theory. In 2010 Grohe showed that fixed point logic with counting captures polynomial time on all classes of graphs with excluded minors. We now consi...
| 出版年: | Logical Methods in Computer Science |
|---|---|
| 第一著者: | |
| フォーマット: | 論文 |
| 言語: | 英語 |
| 出版事項: |
Logical Methods in Computer Science e.V.
2019-03-01
|
| 主題: | |
| オンライン･アクセス: | https://lmcs.episciences.org/4416/pdf |