NP SERIES - NPData Sheet Reliability is your Security

Source URL: www.yuasabatteries.com

• Battery electricity)
• Rechargeable batteries
• Leadacid battery
• Battery
• Separator
• Electrolyte
• VRLA battery

MCS 401 – Computer Algorithms I Spring 2016 Problem Set 4 Lev Reyzin Due: by the beginning of class

Source URL: homepages.math.uic.edu

• Graph theory
• NP-complete problems
• Pathwidth
• Clique problem

PCFGs 2 Questions for PCFGs PCFGs 2

Source URL: cl.indiana.edu

• Probability
• CYK algorithm
• Probability and statistics
• Stochastic context-free grammar
• Applied mathematics
• NP
• Measurement

PDF Document

Source URL: np-schools.com

Leveraging SMT: Using SMT Solvers to Improve Verification; Using Verification to Improve SMT Solvers Clark Barrett Christopher L. Conway

Source URL: fm.csl.sri.com

• Theoretical computer science
• Formal methods
• Logic in computer science
• Constraint programming
• Electronic design automation
• NP-complete problems
• Satisfiability modulo theories
• Solver
• SMT
• Uninterpreted function
• Model checking
• Alt-Ergo

Channel Training and Estimation in Distributed Space-Time Coded Relay Networks with Multiple Transmit/Receive Antennas Sun Sun Yindi Jing

Source URL: www.comm.utoronto.ca

• Radio resource management
• Statistics
• Information theory
• Mathematical analysis
• IEEE 802
• Mathematics
• Complexity classes
• Random matrices
• Cooperative diversity
• MIMO
• NP
• Wishart distribution

 
   2064,   (3) 
 
     

Source URL: www.molrm.gov.np

Approximability Results for the p-Center Problem Stefan Buettcher Course Project Algorithm Design and Analysis

Source URL: stefan.buettcher.org

• Computational complexity theory
• Theory of computation
• Mathematics
• NP-complete problems
• Set cover problem
• NP
• Dominating set
• Approximation algorithm
• Metric k-center
• Optimization problem
• Reduction
• P versus NP problem

What makes the Arc-Preserving Subsequence problem hard?⋆ Guillaume Blin1 , Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1 2

Source URL: pagesperso.lina.univ-nantes.fr

• Computational complexity theory
• Complexity classes
• Theory of computation
• NP
• P
• Reduction
• Time complexity

Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1

Source URL: people.mpi-inf.mpg.de

• Computational complexity theory
• Theory of computation
• Complexity classes
• Approximation algorithms
• Computational hardness assumptions
• Polynomial-time approximation scheme
• Time complexity
• NC
• Reduction
• Exponential time hypothesis
• NP-hardness
• NP