Time complexity - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2007-11-01 07:43:17 Computational complexity theory Interpolation P versus NP problem Time complexity Mathematical optimization Complexity NP Minimum description length Algorithm Theoretical computer science Applied mathematics Mathematics		Add to Reading List Source URL: muehlenbein.org Download Document from Source Website File Size: 228,49 KB Share Document on Facebook

	Vinta: Verification with INTerpolation and Abstract iterpretation Arie Gurfinkel Software Engineering Institute Carnegie Mellon University DocID: 1xVXp - View Document
	Unbounded Model-Checking with Interpolation for Regular Language Constraints Graeme Gange, Jorge A. Navas, Peter J. Stuckey, Harald Søndergaard, and Peter Schachte The University of Melbourne {ggange,jnavas,pjs,harald,s DocID: 1xVMq - View Document
	Selfless Interpolation for Infinite-State Model Checking? Tanja Schindler1 and Dejan Jovanovi´c2 1 University of Freiburg DocID: 1xVsB - View Document
	Efficient Interpolation for the Theory of Arrays (work in progress) Jochen Hoenicke and Tanja Schindler∗ Department of Computer Science, University of Freiburg DocID: 1xViK - View Document
	Verification of Programs by Combining Iterated Specialization with Interpolation E. De Angelis and F. Fioravanti J. A. Navas DocID: 1xUX2 - View Document