On the complexity of equational Horn clauses

Keyphrases

• NP-complete 100%
• Horn Clauses 100%
• Presburger 100%
• Equational Theory 100%
• Efficient Implementation 50%
• Polynomial Time 50%
• Cryptographic Primitives 50%
• Oracle 50%
• Security Protocols 50%
• Algebraic Properties 50%
• Linear Time 50%
• Technical Tools 50%
• Abelian Group 50%
• Tree Automata 50%
• Context-free Languages 50%
• Time Construction 50%
• Unsatisfiability 50%
• Intersection Non-emptiness Problem 50%
• Parikh Images 50%

Computer Science

• Equational Theory 100%
• Cryptographic Primitive 50%
• Tree Automaton 50%
• context-free language 50%
• Security protocols 50%
• Polynomial Time 50%
• Efficient Implementation 50%

Mathematics

• Modulo 100%
• Algebraic Property 33%
• Abelian Group 33%
• XOR 33%
• Linear Time 33%
• Polynomial Time 33%