searchuk.com The UK's Top Choice for
Finding Products & Services That You Need
 HOME    current search:     last search:
     
theorty
coplexity
sort
theory
quicksort
sorting
recursion
algorithm
mergesort
recursive
algorithms
complexity
complexity theory
time complexity
cyclomatic complexity
computational complexity
password complexity
algorithm complexity
low complexity
complexity requirements
complexity analysis
kolmogorov complexity
software complexity
space complexity
irreducible complexity
complexity science
mccabe complexity
sort complexity
code complexity
passwords must meet complexity
complexity of algorithms
communication complexity
chaos complexity
passwords must meet complexity requirements
algorithms and complexity
complexity measure
complexity metrics
cognitive complexity
big o complexity
password complexity requirements
algorithmic complexity
windows 2000 password complexity
chaos and complexity
password must meet complexity


searchuk.com is a search site dedicated to helping users find what they are looking for. We specialize in the UK market and offer the most up-to-date results on the net. Companies that purchase or sell products and services in the UK can be found in the searchuk.com directory which currently contains more than 3 million listings.
 
Top>Computers>Algorithms>Complexity>

> Conferences


1.  Buy Cheap Computers open in new window
Desktops by Processor, HD & Memory. Cheap Computers on Sale.
www.NexTag.co.uk/desktops


2.  Computer - Wikipedia, the free encyclopedia open in new window
Covers the history of computers and how they operate. ... For the company, see Computer Technology Limited. ... Main article: History of computer hardware ...
en.wikipedia.org


3.  Personal computer - Wikipedia, the free encyclopedia open in new window
A stylized illustration of a desktop computer ... A PC may be a home computer, or may be found in an office, often connected to a ...
en.wikipedia.org



A Compendium of NP Optimization Problems open in new window
This is a preliminary version of the catalog of NP optimization problems.
(http://www.nada.kth.se/~viggo/problemlist/compendium.html)

Algorithms and Complexity open in new window
A collection of bookmarks by Heribert Vollmer.
(http://www-info4.informatik.uni-wuerzburg.de/personen/ehemal)

Algorithms and Complexity open in new window
An overview of computational models and methods and how they relate to complexity, with links to selected papers.
(http://www.almaden.ibm.com/cs/k53/algo.html)

Algorithms and Complexity Research Area open in new window
The Oxford University Computing Laboratory's area on Algorithms and complexity, with links to lectures and information.
(http://web.comlab.ox.ac.uk/oucl/research/areas/algs/)

Average-Case Complexity Forum open in new window
Introduction and survey papers.
(http://www.uncg.edu/mat/avg.html)

Blackbox - a SAT Technology Planning System open in new window
Blackbox is a planning system that works by converting problems specified in STRIPS notation into Boolean satisfiability problems, and then solving the problems with a variety of state-of-the-art satisfiability engines.
(http://www.cs.washington.edu/homes/kautz/blackbox/)

Complexity and Approximation open in new window
Combinatorial optimization problems and their approximability properties: by G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi (Springer, 1999). Table of contents, errata, software supplement and a continuously updated catalog of approximability results.
(http://www.nada.kth.se/~viggo/approxbook/)

Complexity of Algorithms open in new window
A list of topics from a Computer Science course involving complexity of algorithms. HTML and PS format.
(http://artemis.cs.yale.edu/classes/cs460/Spring98/contents.h)

Computability and Complexity open in new window
An online course on complexity.
(http://www.csc.liv.ac.uk/~ped/teachadmin/algor/comput_comple)

Computational Complexity open in new window
(Birkhäuser) Tables of contents from vol.7 (1998) on. Full text to subscribers via LINK.
(http://link.springer-ny.com/link/service/journals/00037/)

Computational Complexity and Programming Languages open in new window
Summaries of talks of the DIMACS workshop (July 1996), collected by James Royer.
(http://top.cis.syr.edu/people/royer/talks.html)

Constraint Satisfaction Problems open in new window
Research group in the Computing Laboratory, Oxford University.
(http://web.comlab.ox.ac.uk/oucl/research/areas/constraints/i)

ECCC - Electronic Colloquium on Computational Complexity open in new window
A forum for the rapid and widespread interchange of ideas, techniques, and research in computational complexity. Research reports, surveys and books; meetings, discussions and web resources.
(http://www.eccc.uni-trier.de/eccc/)

Hypertext Bibliography of Measures of Complexity open in new window
Bruce Edmonds; Manchester Metropolitan University.
(http://bruce.edmonds.name/combib/)

Information-based Complexity open in new window
People, publications, prizes.
(http://www.ibc-research.org/)

Parameterized Complexity open in new window
Brief description, list of workers and problem compendium, compiled by Todd Wareham.
(http://www.cs.mun.ca/~harold/W_hier/W_hier.html)

Probabilistically Checkable Proofs and Approximation open in new window
Pointers to some survey articles and their authors, by M. Bellare.
(http://www-cse.ucsd.edu/users/mihir/pcp.html)

Roberto Bayardo's Resources open in new window
Includes the relsat SAT solver and related papers.
(http://www.almaden.ibm.com/cs/people/bayardo/resources.html)

SAT Live! open in new window
A collection of up-to-date links about the satisfiability problem (solvers, benchmarks, articles). A discussion forum is available as well.
(http://www.satlive.org/)

SATLIB - The Satisfiability Library open in new window
A collection of benchmark problems, solvers, and tools. One strong motivation for creating SATLIB is to provide a uniform test-bed for SAT solvers as well as a site for collecting SAT problem instances, algorithms, and empirical characterisations of the algorithms' performance.
(http://www.intellektik.informatik.tu-darmstadt.de/SATLIB/)

Stas Busygin's NP-Completeness Page open in new window
A proposal for solving NP-hard problems.
(http://www.busygin.dp.ua/npc.html)

The P versus NP Problem open in new window
Description of the P vs NP question, designated a Clay Mathematics Institute Millennium Prize Problems, by Stephen Cook.
(http://www.claymath.org/prize_problems/p_vs_np.htm)


&catid=775777
· DE
· ES
· NL
· UK
&catid=775777
 
· UK Directory
· Global Directory
&catid=775777
 
· Bookmark us
· Contact us
· About us
· Privacy Policy
· Terms of Use
· Advertising
· List your Site
&catid=775777
&catid=775777 &catid=775777 &catid=775777
  Copyright © 1996 - 2007 searchuk.com and its licensors - All rights reserved


Computer   Compensation   Entertainment   Finance   Health   Insurance   Travel   Adult   Beauty   Cars   Dating   Electronics   Food & Wine   Gambling   Games   Gifts   Home & Garden   Internet   Jobs   Mobile Phone   Pension   Property   Shopping   Sports   Uk  
 
 

 
Help build the largest human-edited directory on the web.
Submit a Site - Open Directory Project - Become an Editor