Titel

Merkliste
1 Ergebnisse

Representing reductions of NP-complete problems in logical ..:

, In: Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding,

Schürmann, Carsten ; Shah, Jatin - p. 1-10 , 2003

Link: https://dl.acm.org/doi/10.1145/976571.976579

RT 
T1 <cTitle>Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding</cTitle>: T1 <Title>Representing reductions of NP-complete problems in logical frameworks				: a case study</Title>

UL https://suche.suub.uni-bremen.de/peid=acm-976579&Exemplar=1&LAN=DE
				
A1 Schürmann, Carsten
A1 Shah, Jatin
PB ACM
YR 2003
K1 NP-complete problems
K1 linear logic
K1 logical frameworks
K1 Computing methodologies
K1 Artificial intelligence
K1 Knowledge representation and reasoning
K1 Logic programming and answer set programming
K1 Software and its engineering
K1 Software notations and tools
K1 General programming languages
K1 Language types
K1 Constraint and logic languages
K1 Symbolic and algebraic manipulation
K1 Symbolic and algebraic algorithms
K1 Theorem proving algorithms
K1 Theory of computation
K1 Logic
K1 Constraint and logic programming
K1 Computational complexity and cryptography
K1 Problems, reductions and completeness
K1 Machine learning
K1 Machine learning approaches
K1 Rule learning
SP 1
OP 10
LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/976571.976579
DO https://dl.acm.org/doi/10.1145/976571.976579
SF ELIB - SuUB Bremen

Export

RefWorks (nur Desktop-Version!)
Flow (Zuerst in Flow einloggen, dann importieren)