In complexity theory, UP ("Unambiguous Non-deterministic Polynomial-time") is the complexity class of decision problems solvable in polynomial timeâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Michael Steinitz, J. Grunzweig-Genossar
- 2017

We measured the thermal expansion of a polycrystalline lump of uranium monophosphide, using a sensitive capacitance dilatometerâ€¦Â (More)

Is this relevant?

2016

2016

- Xiang Ren, Weidong Ding, Zhaozhi Long, Wenting Li, Feng Li, Guan-Jun Zhang
- IEEE Transactions on Instrumentation andâ€¦
- 2016

The low-impedance impulse voltage calibrator of high accuracy and stability can be used as a primary reference of impulse voltageâ€¦Â (More)

Is this relevant?

2012

2012

The synthesis of classical Computational Complexity Theory with Recursive Analysis provides a quantitative foundation to reliableâ€¦Â (More)

Is this relevant?

2011

2011

- Lance Fortnow, Joshua A. Grochow
- Inf. Comput.
- 2011

To determine if two lists of numbers are the same set, we sort both lists and see if we get the same result. The sorted list is aâ€¦Â (More)

Is this relevant?

2010

2010

- Giorgio Bruno
- 2010 Fourth International Conference on Researchâ€¦
- 2010

This paper points out a number of limitations in the way current notations and languages handle the relations between processesâ€¦Â (More)

Is this relevant?

2008

2008

- Ker-I Ko, Fuxiang Yu
- Electr. Notes Theor. Comput. Sci.
- 2008

We investigate the computational complexity of computing the convex hull of a two-dimensional set. We study this problem in theâ€¦Â (More)

Is this relevant?

1998

1998

- M. Skriganova, A. N. Starkovba Steklov
- 1998

In the present paper we give an improvement of a previous result of the paper Skr, Theorem 2.2] on logarithmically small errorsâ€¦Â (More)

Is this relevant?

1997

1997

- Jochen Messner, Jacobo TorÃ¡n
- STACS
- 1997

A polynomial time computable function h : ! whose range is the set of tau-tologies in Propositional Logic (TAUT), is called aâ€¦Â (More)

Is this relevant?

1994

1994

- Klaus-JÃ¶rn Lange, Peter Rossmanith
- Structure in Complexity Theory Conference
- 1994

The classes NCk and A C k are defined by computational devices of polynomial size, i.e., by devices using a polynomially boundedâ€¦Â (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- Johannes KÃ¶bler, Uwe SchÃ¶ning, Seinosuke Toda, Jacobo TorÃ¡n
- Structure in Complexity Theory Conference
- 1989

The intractability of the complexity class NP has motivated the study of subclasses that arise when certain restrictions on theâ€¦Â (More)

Is this relevant?