The complexity of Tarski's fixed point theorem

Authors:
Ching-Lueh Chang;Yuh-Dauh Lyuu;Yen-Wu Ti
Affiliations:
Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan and Department of Finance, National Taiwan University, Taipei, Taiwan;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan
Venue:
Theoretical Computer Science
Year:
2008

Citing 4
Cited 2

Abstract interpretation and application to logic programs

Journal of Logic Programming
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Discrete and Combinatorial Mathematics: An Applied Introduction

Discrete and Combinatorial Mathematics: An Applied Introduction
Refining Model Checking by Abstract Interpretation

Automated Software Engineering

Optimal bounds on finding fixed points of contraction mappings

Theoretical Computer Science
The complexity of determining the uniqueness of Tarski's fixed point under the lexicographic ordering

WINE'10 Proceedings of the 6th international conference on Internet and network economics

Quantified Score

Hi-index	5.23

Visualization

Abstract

Tarski's fixed point theorem guarantees the existence of a fixed point of an order-preserving function f:L-L defined on a nonempty complete lattice (L,@?) [B. Knaster, Un theoreme sur les fonctions d'ensembles, Annales de la Societe Polonaise de Mathematique 6 (1928) 133-134; A. Tarski, A lattice theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics 5 (1955) 285-309]. In this paper, we investigate several algorithmic and complexity-theoretic topics regarding Tarski's fixed point theorem. In particular, we design an algorithm that finds a fixed point of f when it is given (L,@?) as input and f as an oracle. Our algorithm makes O(log|L|) queries to f when @? is a total order on L. We also prove that when both f and (L,@?) are given as oracles, any deterministic or randomized algorithm for finding a fixed point of f makes an expected @W(|L|) queries for some (L,@?) and f.