EXPTIME - PDFSEARCH.IO - Document Search Engine

EXPTIME
Results: 32

#	Item
1	Introduction & Motivation Relations and Operations Boolean and 3-element cases Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-08-14 00:50:42 Computational complexity theory Complexity classes Theory of computation FO PSPACE SO P EXPTIME Boolean algebra Co-NP-complete Reduction Descriptive complexity theory
2	An ExpTime Tableau Method for Dealing with Nominals and Quantified Number Restrictions in Deciding the Description Logic SHOQ Linh Anh Nguyen1,2 and Joanna Goli´ nska-Pilarek3 1 Add to Reading List Source URL: ceur-ws.org Language: English - Date: 2013-09-03 07:12:26 Automated theorem proving Method of analytic tableaux
3	PDF Document Add to Reading List Source URL: www.cs.swan.ac.uk Language: English - Date: 2015-05-05 07:12:16 Complexity classes Theory of computation Theoretical computer science Mathematics FO PSPACE P Recursion EXPTIME Low
4	Deciding k CFA is complete for EXPTIME ∗ David Van Horn Harry G. Mairson Brandeis University Add to Reading List Source URL: www.ccs.neu.edu Language: English - Date: 2008-07-22 12:06:28
5	Lecture 5: Introduction to Complexity TheoryComplexity Theory Add to Reading List Source URL: www.cs.rice.edu Language: English - Date: 2014-10-16 13:22:26 Applied mathematics P EXPTIME EXPSPACE L FO 2-EXPTIME Theoretical computer science Computational complexity theory Complexity classes
6	Nim is Easy, Chess is Hard — But Why??∗ Aviezri S. Fraenkel†‡§ January 7, 2007 Department of Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot 76100, Israel Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2007-01-07 03:13:10 Abstract strategy games Combinatorial game theory Board games Mathematical games Computer chess Outline of chess Nim Transcendental chess EXPTIME Games Chess Chess variants
7	Algorithms: Complexity Classes and Lower Bounds Martin Held FB Computerwissenschaften Universität Salzburg A-5020 Salzburg, Austria Add to Reading List Source URL: www.cosy.sbg.ac.at Language: English - Date: 2014-10-17 01:42:07 Complexity classes P versus NP problem NP P Low EXPTIME NC Parameterized complexity Karp–Lipton theorem Theoretical computer science Computational complexity theory Applied mathematics
8	Succinct Randomized Encodings and their Applications∗ Nir Bitansky† Sanjam Garg‡ Huijia Lin§ Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-04-21 11:01:51 Complexity classes EXPTIME P/poly Time complexity PP NL P NC Theoretical computer science Computational complexity theory Applied mathematics
9	FIRE: Interactive Visual Support for Parameter Space-Driven Rule Mining∗ Abhishek Mukherji, Xika Lin, Jason Whitehouse, Christopher R. Botaish, Elke A. Rundensteiner and Matthew O. Ward Computer Science Department, Wor Add to Reading List Source URL: davis.wpi.edu Language: English - Date: 2013-08-11 23:24:29 Mathematics Data mining Data analysis Statistical inference Association rule learning Confidence interval PSPACE Usability EXPTIME Statistics Applied mathematics Complexity classes
10	CENTRE DE RECERCA MATEMATICA INSTITUT D’ESTUDIS CATALANS Apartat 50, E[removed]Bellaterra Separation of Complexity classes in Koiran’s weak model Add to Reading List Source URL: www6.cityu.edu.hk Language: English - Date: 2012-09-11 23:37:34 Complexity classes Structural complexity theory Mathematical optimization NP PP P Time complexity EXPTIME Reduction Theoretical computer science Computational complexity theory Applied mathematics