Constraints, Graphs, Algebra, Logic, and Complexity

被引：0

作者：

Vardi, Moshe Y. ^{[1
]}

机构：

[1] Rice Univ, Dept Comp Sci, Houston, TX 77005 USA

来源：

IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2011) | 2011年 / 13卷

关键词：

constraint satisfaction; NP completeness; dichotomy;

D O I：

10.4230/LIPIcs.FSTTCS.2011.3

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

下载

页码：3 / 3

页数：1

共 50 条

[1] Constraints, Graphs, Algebra, Logic, and Complexity
Vardi, Moshe Y.
PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING-CP 2010, 2010, 6308 : 8 - 8
[2] A Rendezvous of Logic, Complexity, and Algebra
Chen, Hubie
ACM COMPUTING SURVEYS, 2009, 42 (01)
[3] ESTIMATE OF COMPLEXITY OF A FUNCTION OF LOGIC ALGEBRA
KAREV, GP
TRESKOV, SA
FRIDMAN, GS
DOKLADY AKADEMII NAUK SSSR, 1965, 165 (04): : 745 - &
[4] THE COMPLEXITY OF APPROXIMATE ASSIGNMENT OF FUNCTIONS IN THE ALGEBRA OF LOGIC
DZHAVADOV, RM
DOKLADY AKADEMII NAUK SSSR, 1982, 265 (01): : 24 - 27
[5] Extension of simple conceptual graphs: the complexity of rules and constraints
Baget, JF
Mugnier, ML
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2002, 16 : 425 - 465
[6] Membership-constraints and complexity in logic programming with sets
Stolzenburg, F
FRONTIERS OF COMBINING SYSTEMS, 1996, 3 : 285 - 302
[7] LOGIC OF PEIRCE,CS - FROM ALGEBRA TO GRAPHS - FRENCH - THIBAUD,P
GRATTANGUINNESS, I
BRITISH JOURNAL FOR THE HISTORY OF SCIENCE, 1977, 10 (36): : 255 - 256
[8] ASYMPTOTIC ESTIMATES OF THE COMPLEXITY OF THE FORMULAS WHICH REALIZE THE FUNCTIONS OF LOGIC ALGEBRA
LUPANOV, OB
DOKLADY AKADEMII NAUK SSSR, 1959, 128 (03): : 464 - 467
[9] Entanglement -: A measure for the complexity of directed graphs with applications to logic and games
Berwanger, D
Grädel, E
LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, PROCEEDINGS, 2005, 3452 : 209 - 223
[10] Monadic Second Order Logic on Graphs with Local Cardinality Constraints
Szeider, Stefan
ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2011, 12 (02)

← 1 2 3 4 5 →