Non-elementary lower bound for Propositional Duration Calculus (Q1129106): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 |
Revision as of 15:47, 28 May 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