z-logo
open-access-imgOpen Access
Limits of Preprocessing
Author(s) -
Stefan Szeider
Publication year - 2011
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - Uncategorized
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v25i1.7816
Subject(s) - preprocessor , time complexity , kernelization , polynomial , constraint satisfaction problem , satisfiability , kernel (algebra) , constraint (computer aided design) , constraint satisfaction , computational complexity theory , computer science , mathematics , algorithm , mathematical optimization , discrete mathematics , parameterized complexity , artificial intelligence , probabilistic logic , mathematical analysis , geometry

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom