Pages that link to "Item:Q3839881"
From MaRDI portal
The following pages link to A POLYNOMIAL TIME ALGORITHM FOR LOCAL TESTABILITY AND ITS LEVEL (Q3839881):
Displaying 8 items.
- Reducing the time complexity of testing for local threshold testability (Q703505) (← links)
- Local testability from words to traces, a suitable definition (Q728279) (← links)
- Algebraic method for generation of locally trivial tests (Q920941) (← links)
- Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order (Q1978707) (← links)
- Execution monitoring enforcement under memory-limitation constraints (Q2482440) (← links)
- GROUPS WHOSE GEODESICS ARE LOCALLY TESTABLE (Q3528858) (← links)
- A Local Criterion for Polynomial-Time Stratified Computations (Q5747634) (← links)
- A probabilistic algorithm to test local algebraic observability in polynomial time (Q5892265) (← links)