Skip to search formSkip to main contentSkip to account menu

IP (complexity)

Known as: IP 
In computational complexity theory, the class IP (which stands for Interactive Polynomial time) is the class of problems solvable by an interactive… 
Wikipedia (opens in a new tab)

Related topics

Related topics

25 relations
ACC0Arthur–Merlin protocolBQPComplexity class

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
Traffic classification through simple statistical fingerprinting
The classification of IP ows according to the application that generated them is at the basis of any modern network management… 
Highly Cited
2005
Highly Cited
2005
Embedding Covert Channels into TCP/IP
It is commonly believed that steganography within TCP/IP is easily achieved by embedding data in header fields seemingly filled… 
Highly Cited
2004
Highly Cited
2004
An algebraic approach to practical and scalable overlay network monitoring
Overlay network monitoring enables distributed Internet applications to detect and recover from path outages and periods of… 
Highly Cited
2002
Highly Cited
2002
Comparison of IP micromobility protocols
We present a performance comparison of a number of key micromobility protocols that have been discussed in the IETF Mobile IP… 
Highly Cited
2001
Highly Cited
2001
Integrated dynamic IP and wavelength routing in IP over WDM networks
This paper develops an algorithm for integrated dynamic routing of bandwidth guaranteed paths in IP over WDM networks. By… 
Highly Cited
2001
Highly Cited
2001
Using multiple hash functions to improve IP lookups
High performance Internet routers require a mechanism for very efficient IP address lookups. Some techniques used to this end… 
Highly Cited
2001
Highly Cited
2001
A non-instrusive, wavelet-based approach to detecting network performance problems
The main objective of this paper is to explore how much information about the characteristics of end-to-end network paths can be… 
Highly Cited
2001
Highly Cited
2001
A control theoretic approach to active queue management
Highly Cited
2000
Highly Cited
2000
A stochastic model of TCP/IP with stationary random losses
We present a technique for identifying repetitive information transfers and use it to analyze the redundancy of network traffic… 
Review
1998
Review
1998
Homoclinic orbits in reversible systems and their applications in mechanics
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)