A polynomial time algorithm for Zero-Clairvoyant scheduling

Journal of Applied Logic 5 (4):667-680 (2007)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.jal.2006.08.001

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Max sat approximation beyond the limits of polynomial-time approximation.Evgeny Dantsin, Michael Gavrilovich, Edward A. Hirsch & Boris Konev - 2001 - Annals of Pure and Applied Logic 113 (1-3):81-94.
A decision algorithm for linear sentences on a PFM.Lian Li, Huilin Li & Yixun Liu - 1993 - Annals of Pure and Applied Logic 59 (3):273-286.
Proving theorems of the second order Lambek calculus in polynomial time.Erik Aarts - 1994 - Studia Logica 53 (3):373 - 387.
Sock Sorting: An Example of a Vague Algorithm.Rohit Parikh, Laxmi Parida & Vaughan Pratt - 2001 - Logic Journal of the IGPL 9 (5):687-692.
Deciding confluence of certain term rewriting systems in polynomial time.Guillem Godoy, Ashish Tiwari & Rakesh Verma - 2004 - Annals of Pure and Applied Logic 130 (1-3):33-59.
On polynomial time computation over unordered structures.Andreas Blass, Yuri Gurevich & Saharon Shelah - 2002 - Journal of Symbolic Logic 67 (3):1093-1125.
Light affine lambda calculus and polynomial time strong normalization.Kazushige Terui - 2007 - Archive for Mathematical Logic 46 (3-4):253-280.
Feasible Graphs and Colorings.Douglas Cenzer & Jeffrey Remmel - 1995 - Mathematical Logic Quarterly 41 (3):327-352.
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds.Kate Copestake - 1997 - Mathematical Logic Quarterly 43 (3):287-310.
A Fast Deterministic Algorithm For Formulas That Have Many Satisfying Assignments.E. Hirsch - 1998 - Logic Journal of the IGPL 6 (1):59-71.
Machines Over the Reals and Non‐Uniformity.Felipe Cucker - 1997 - Mathematical Logic Quarterly 43 (2):143-157.
Polynomial games and determinacy.Tomoyuki Yamakami - 1996 - Annals of Pure and Applied Logic 80 (1):1-16.
Consistency, optimality, and incompleteness.Yijia Chen, Jörg Flum & Moritz Müller - 2013 - Annals of Pure and Applied Logic 164 (12):1224-1235.
Polynomial Time Uniform Word Problems.Stanley Burris - 1995 - Mathematical Logic Quarterly 41 (2):173-182.
On the Complexity of Alpha Conversion.Rick Statman - 2007 - Journal of Symbolic Logic 72 (4):1197 - 1203.

Analytics

Added to PP
2016-06-30

Downloads
19 (#750,145)

6 months
18 (#125,972)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Temporal constraint networks.Rina Dechter, Itay Meiri & Judea Pearl - 1991 - Artificial Intelligence 49 (1-3):61-95.

Add more references