Author:
Wojciechowski Piotr,Subramani K.,Williamson Matthew
Funder
Air Force Office of Scientific Research
Air Force Research Laboratory
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference28 articles.
1. Minimum propositional proof length is NP-hard to linearly approximate;Alekhnovich,1998
2. Propositional proof complexity: Past, present, future;Beame;Bull. EATCS,1998
3. Patrick Cousot, Radhia Cousot, Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: POPL, 1977, pp. 238–252.
4. Über die Theorie der Einfachen Ungleichungen;Farkas;J. Reine Angew. Math.,1902
5. Parametric dispatching of hard real-time tasks;Gerber;IEEE Trans. Comput.,1995