z-logo
open-access-imgOpen Access
Constraint Satisfaction with Counting Quantifiers
Author(s) -
Barnaby Martin,
Florent Madelaine,
Juraj Stacho
Publication year - 2015
Publication title -
siam journal on discrete mathematics
Language(s) - Uncategorized
Resource type - Journals
SCImago Journal Rank - 0.843
H-Index - 66
eISSN - 1095-7146
pISSN - 0895-4801
DOI - 10.1137/140981332
Subject(s) - existential quantification , mathematics , combinatorics , constraint satisfaction problem , bipartite graph , discrete mathematics , quantifier (linguistics) , trichotomy (philosophy) , clique , pspace , decision problem , graph , computational complexity theory , algorithm , computer science , linguistics , statistics , philosophy , artificial intelligence , probabilistic logic
International audienc

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