Complexity - PDFSEARCH.IO - Document Search Engine

Complexity
Results: 8084

#	Item
781	COMPLEXITY AND APPROXIMABILITY OF THE COVER POLYNOMIAL ¨ser, Holger Dell, and Mahmoud Fouz Markus Bla Abstract. The cover polynomial and its geometric version introduced by Chung & Graham and D’Antona & Munarini, res Add to Reading List Source URL: www-cc.cs.uni-saarland.de Language: English - Date: 2014-01-17 04:55:28 Mathematics Computational complexity theory Graph theory Polynomials Complexity classes Computational problems Mathematical optimization Tutte polynomial Chromatic polynomial Optimization problem NP Matroid
782	Fast d-DNNF Compilation with sharpSAT Christian Muise Sheila McIlraith J. Christopher Beck Add to Reading List Source URL: www.haz.ca Language: English - Date: 2013-10-28 07:18:32 Theoretical computer science Mathematics Formal methods Constraint programming Boolean algebra Automated theorem proving DPLL algorithm Binary decision diagram Exponential time hypothesis Computational complexity theory Bayesian network Distribution
783	The increasing size and complexity of biomedical data could dramatically enhance basic discovery and prediction for applications. Realizing this potential requires analytics that are simultaneously selective, accurate, p Add to Reading List Source URL: mmds-data.org Language: English - Date: 2016-06-23 15:50:48 Futurology Prediction Scientific method Regression analysis Statistics Science
784	Reading Beside the Lines: Indentation as a Proxy for Complexity Metrics Abram Hindle University of Waterloo Waterloo, Ontario Canada Add to Reading List Source URL: plg.uwaterloo.ca Language: English - Date: 2008-03-16 18:36:16 Software engineering Computer programming Software metrics Source code Software Indentation Indent style Cyclomatic complexity Lexical analysis Programming complexity Source lines of code Complexity
785	Advances in Abstract Categorial Grammars Language Theory and Linguistic Modeling Lecture 5 Add to Reading List Source URL: research.nii.ac.jp Language: English - Date: 2010-06-08 00:59:22 Complexity classes Syntax NP Parse tree Cognitive science Grammar Philosophy of language CYK algorithm
786	Verification of Markov Decision Processes using Learning Algorithms? Tom´asˇ Br´azdil1 , Krishnendu Chatterjee2 , Martin Chmel´ık2 , Vojtˇech Forejt3 , Jan Kˇret´ınsk´y2 , Marta Kwiatkowska3 , David Parker4 , a Add to Reading List Source URL: www.hieratic.eu Language: English Computational complexity theory Theory of computation Dynamic programming Markov decision process Stochastic control Analysis of algorithms Mathematical logic Reinforcement learning Time complexity Algorithm PP
787	Networks embedded in Lorentzian spaces James R Clough & Tim Evans Imperial College London, Centre for Complexity Science September 11, 2015 Add to Reading List Source URL: www.monmeetings.org Language: English - Date: 2015-09-16 12:54:24 Lorentzian manifolds Theoretical physics Theory of relativity Exact solutions in general relativity Causal sets Quantum gravity Spacetime Metric tensor Minkowski space Hyperbolic geometry Pseudo-Riemannian manifold
788	J. Cryptol: 116–135 DOI: s00145x Parallel Repetition of Computationally Sound Protocols Revisited∗ Krzysztof Pietrzak Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2012-05-30 09:00:34 Complexity classes Cryptography Computational complexity theory Proof of knowledge IP Quantum complexity theory Soundness NP Commitment scheme PSPACE PP Security parameter
789	Journal of Artificial Intelligence ResearchSubmitted 3/11; published 7/11 Controlling Complexity in Part-of-Speech Induction João V. Graça Add to Reading List Source URL: www.seas.upenn.edu Language: English - Date: 2011-08-24 11:02:38 Markov models Estimation theory Statistical theory Bayesian statistics Regression analysis Expectationmaximization algorithm Hidden Markov model BaumWelch algorithm Part-of-speech tagging Maximum likelihood estimation Likelihood function KullbackLeibler divergence
790	The complexity of positive first-order logic without equality∗ Florent Madelaine Univ Clermont1, EA2146, Laboratoire d’algorithmique et d’image de Clermont-Ferrand, Aubi`ere, F-63170, France. fmadelaine@laic.u-cler Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-11-10 10:55:46 Complexity classes Structural complexity theory FO Finite model theory Computational complexity theory IP Homomorphism NP Reduction Symbol P versus NP problem Model theory

UPDATE