11 papers:
LICS-2001-Ganzinger #concept #decidability #problem #semantics #word- Relating Semantic and Proof-Theoretic Concepts for Polynominal Time Decidability of Uniform Word Problems (HG), pp. 81–90.
- LICS-2001-MitchellRST #analysis #calculus #probability #process #protocol #security
- Probabilistic Polynominal-Time Process Calculus and Security Protocol Analysis (JCM, AR, AS, VT), pp. 3–5.
ICALP-2000-Buresh-OppenheimCIP #calculus- Homogenization and the Polynominal Calculus (JBO, MC, RI, TP), pp. 926–937.
- ICALP-2000-JansenP #approximate #multi #scheduling
- Polynominal Time Approximation Schemes for General Multiprocessor Job Shop Scheduling (KJ, LP), pp. 878–889.
- ICALP-2000-KrivelevichV #approximate #independence
- Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time (MK, VHV), pp. 13–24.
CSL-2000-Shelah #logic- Choiceless Polynominal Time Logic: Inability to Express (SS), pp. 72–125.
ICML-1998-KearnsS #learning- Near-Optimal Reinforcement Learning in Polynominal Time (MJK, SPS), pp. 260–268.
ILPS-1993-PalopoliZ #modelling- Polynominal Time Computable Stable Models (LP, CZ), p. 645.
STOC-1988-Ben-OrT #algorithm #multi- A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract) (MBO, PT), pp. 301–309.
- STOC-1988-Ko
- Relativized Polynominal Time Hierarchies Having Exactly K Levels (KIK), pp. 245–253.
- STOC-1988-Orlin #algorithm #performance
- A Faster Strongly Polynominal Minimum Cost Flow Algorithm (JBO), pp. 377–387.
