Structural complexity theory

Results: 144



#Item
1The Complexity of Counting and Randomised Approximation Magnus Bordewich New College University of Oxford

The Complexity of Counting and Randomised Approximation Magnus Bordewich New College University of Oxford

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2003-12-08 11:12:51
2ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND  LANCE FORTNOWz

ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND LANCE FORTNOWz

Add to Reading List

Source URL: cs-www.cs.yale.edu

Language: English - Date: 2001-10-25 12:45:35
3Microsoft Word - MS-wccm12

Microsoft Word - MS-wccm12

Add to Reading List

Source URL: www.cs.utep.edu

Language: English - Date: 2015-10-30 22:10:53
4Microsoft Word - fp16-armoni.doc

Microsoft Word - fp16-armoni.doc

Add to Reading List

Source URL: www.openu.ac.il

Language: English - Date: 2009-03-16 13:42:11
5Issues in Multimedia Authoring Lecture 10: Limitations of Computers Keith Douglas  Summary

Issues in Multimedia Authoring Lecture 10: Limitations of Computers Keith Douglas Summary

Add to Reading List

Source URL: philosopher-animal.com

Language: English - Date: 2007-04-18 22:48:16
6Automatically Computing Program Path Complexity Lucas Bang, Abdulbaki Aydin, and Tevfik Bultan I. I NTRODUCTION Recent automated software testing techniques focus on achieving path coverage. We present a program complexi

Automatically Computing Program Path Complexity Lucas Bang, Abdulbaki Aydin, and Tevfik Bultan I. I NTRODUCTION Recent automated software testing techniques focus on achieving path coverage. We present a program complexi

Add to Reading List

Source URL: gswc.cs.ucsb.edu

Language: English - Date: 2016-03-01 02:43:37
7A maximum feasible linear subsystem problem for modeling noise pollution around airports Sandra Hommersom)

A maximum feasible linear subsystem problem for modeling noise pollution around airports Sandra Hommersom)

Add to Reading List

Source URL: www.math.ru.nl

Language: English - Date: 2016-04-12 05:51:20
8The 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

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
9YouGov Survey Results Sample Size: 1652 GB Adults Fieldwork: 28th - 29th July 2016 EU Referednum Vote  Vote in 2015

YouGov Survey Results Sample Size: 1652 GB Adults Fieldwork: 28th - 29th July 2016 EU Referednum Vote Vote in 2015

Add to Reading List

Source URL: d25d2506sfb94s.cloudfront.net

Language: English - Date: 2016-08-02 05:56:44
10Introduction & Motivation  Relations and Operations The complexity of positive equality-free first-order logic II: the four-element case

Introduction & Motivation Relations and Operations The complexity of positive equality-free first-order logic II: the four-element case

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2010-08-24 16:58:08