skip to content


This page lists the preprints associated with this programme only.
A full list is also available, with details of how to submit relevant papers and how to acknowledge INI.

Search preprint archive
Authors Title Attachments
K Kulesza Machines, computations and time; when P can be equal NP PDF icon ni07010.pdf
A Atserias; A Bulatov Affine systems of equations and counting infinitary logic PDF icon ni07002.pdf
S Dantchev Parameterized proof complexity: A complexity gap for parameterized tree-like resolution PDF icon ni06054.pdf
J Nesetril On the density of Trigraph Homomorphisms PDF icon ni06052.pdf
S Cook; J Krajicek Consequences of the Provability of $NP \subseteq P/poly$ PDF icon ni06040.pdf
S Lindell A normal form for first-order logic over doubly-linked data structures PDF icon ni06037.pdf
F Moller Weak bisimulation approximants PDF icon ni06028.pdf
N Alechina; D Shkatov Logics with an existential modality PDF icon ni06025.pdf
G Kun; J Nesetril Forbidden lifts (NP and CSP for combinatorists) PDF icon ni06024.pdf
F Boerner; A Bulatov The complexity of constraint satisfaction games and QCSP PDF icon ni06023.pdf
J Krajicek NP search problems in low fragments of bounded arithmetic PDF icon ni06022.pdf
S Vorobyov Fast algorithms for monotonic discounted linear programs with two variables per inequality PDF icon ni06019.pdf
W Hodges Logics of imperfect information: why sets of assignments? PDF icon ni06015.pdf
J Krajicek Substitutions into propositional tautologies PDF icon ni06012.pdf
K Kulesza On inverting the VMPC one-way function PDF icon ni06009.pdf
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons