Non-elementary lower bound for Propositional Duration Calculus (Q1129106): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Alexander Rabinovich / rank | |||
Property / author | |||
Property / author: Alexander Rabinovich / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A uniform method for proving lower bounds on the computational complexity of logical theories / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5641083 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4222923 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4131648 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Duration calculus: Logical foundations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4281508 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A calculus of durations / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(98)00027-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1993397971 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:58, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Non-elementary lower bound for Propositional Duration Calculus |
scientific article |
Statements
Non-elementary lower bound for Propositional Duration Calculus (English)
0 references
13 August 1998
0 references
Duration Calculus
0 references
Propositional Duration Calculus
0 references
Real time systems
0 references
Star free expressions
0 references
Complexity
0 references
0 references