Determining Implication of Fixed Matrix Prenex Normal Forms Can Be Decided in Linear Time
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917994178805760 |
|---|---|
| author | Wang, Adam |
| author_facet | Wang, Adam |
| contents | For a fixed arbitrary matrix depending on $n$ variables, one may ask whether a Prenex Normal Form (PNF) implies another. A RAM algorithm running in linear time is presented and shown to be asymptotically optimal. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_15294 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Determining Implication of Fixed Matrix Prenex Normal Forms Can Be Decided in Linear Time Wang, Adam Data Structures and Algorithms Discrete Mathematics For a fixed arbitrary matrix depending on $n$ variables, one may ask whether a Prenex Normal Form (PNF) implies another. A RAM algorithm running in linear time is presented and shown to be asymptotically optimal. |
| title | Determining Implication of Fixed Matrix Prenex Normal Forms Can Be Decided in Linear Time |
| topic | Data Structures and Algorithms Discrete Mathematics |
| url | https://arxiv.org/abs/2504.15294 |